2006/01/01 by Jianer Chen, Iyad Kanj, Iyad A. Kanj +1 · 2 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Algorithm #Bounded function #Combinatorics #Complexity and Algorithms in Graphs #Computational complexity theory #Computer science #Cover (algebra) #Discrete mathematics #Exponential function #Graph #Mathematical analysis #Mathematics #PSPACE #Parameterized complexity #Polynomial #Polynomial and algebraic computation #Space (punctuation) #Time complexity #Upper and lower bounds #Vertex (graph theory) #Vertex cover
paper · doi:10.1007/11821069_21
crossref issued 2006/01/01 · crossref published 2006/01/01 · crossref published-print 2006/01/01 · openalex publication_date 2006/01/01 · crossref created 2006/08/25 · crossref deposited 2021/04/27 · openalex created_date 2025/10/10 · crossref indexed 2026/07/14 · openalex updated_date 2026/07/29