OpenAlex
The computational complexity of graph contractions I: Polynomially solvable and NP‐complete cases
Work
Year: 2007
Type: article
Abstract: For a fixed pattern graph H , let H ‐C ONTRACTIBILITY denote the problem of deciding whether a given input graph is contractible to H . This paper is part I of our study on the computational complexi... more
Source: Networks
Authors Asaf Levin, Daniël Paulusma, Gerhard J. Woeginger
Institutions Hebrew University of Jerusalem, Durham University, Eindhoven University of Technology
Cites: 11
Cited by: 27
Related to: 10
FWCI: 1.212
Citation percentile (by year/subfield): 85.42
Topic: Complexity and Algorithms in Graphs
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze