OpenAlex
Some APX-completeness results for cubic graphs
Work
Year: 2000
Type: article
Source: Theoretical Computer Science
Authors Paola Alimonti, Viggo Kann
Institutions Sapienza University of Rome, KTH Royal Institute of Technology
Cites: 22
Cited by: 361
Related to: 10
FWCI: 3.284
Citation percentile (by year/subfield): 99.98
Topic: Complexity and Algorithms in Graphs
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: closed