The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases

✍ Scribed by Asaf Levin; Daniel Paulusma; Gerhard J. Woeginger

• Publisher: John Wiley and Sons
• Year: 2007
• Tongue: English
• Weight: 371 KB
• Volume: 51
• Category: Article
• ISSN: 0028-3045
• DOI: 10.1002/net.20214