NP-completeness results for edge modification problems
Authors:
- 15 August 2006
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 154 (13) , 1824-1844
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- Polynomial time recognition of unit circular-arc graphsJournal of Algorithms, 2006
- Recognizing Berge GraphsCombinatorica, 2005
- Linear-Time Recognition of Circular-Arc GraphsAlgorithmica, 2003
- Bicliques in Graphs I: Bounds on Their NumberCombinatorica, 2000
- Orienting graphs to optimize reachabilityInformation Processing Letters, 1997
- Bicliques in graphs II: Recognizing k-path graphs and underlying graphs of line digraphs1997
- Four Strikes Against Physical Mapping of DNAJournal of Computational Biology, 1995
- Recognition of Circle GraphsJournal of Algorithms, 1994
- The complexity of some edge deletion problemsIEEE Transactions on Circuits and Systems, 1988
- Some simplified NP-complete graph problemsTheoretical Computer Science, 1976