Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties
Authors:
- Sara CohenSCSara Cohen
- Benny KimelfeldBKBenny Kimelfeld
- Yehoshua SagivYSYehoshua Sagiv
- 1 November 2008
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 74 (7) , 1147-1159
Abstract
No abstract availableKeywords
All Related Versions
This publication has 25 references indexed in Scilit:
- Efficiently enumerating results of keyword search over data graphsInformation Systems, 2008
- A new approach for approximating node deletion problemsInformation Processing Letters, 2003
- The Speed of Hereditary Properties of GraphsJournal of Combinatorial Theory, Series B, 2000
- Approximating Clique and Biclique ProblemsJournal of Algorithms, 1998
- A unified approximation algorithm for node-deletion problemsDiscrete Applied Mathematics, 1998
- Reverse search for enumerationDiscrete Applied Mathematics, 1996
- Graph Sandwich ProblemsJournal of Algorithms, 1995
- Enumeration of acyclic walks in a graphDiscrete Applied Mathematics, 1993
- On generating all maximal independent setsInformation Processing Letters, 1988
- The complexity of computing the permanentTheoretical Computer Science, 1979