Space-optimal, backtracking algorithms to list the minimal vertex separators of a graph
Author:
- Ken TakataKTKen Takata
- 1 August 2010
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 158 (15) , 1660-1667
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- A local approach to concept generationAnnals of Mathematics and Artificial Intelligence, 2007
- Safe separators for treewidthDiscrete Mathematics, 2006
- Representing a concept lattice by a graphDiscrete Applied Mathematics, 2004
- Treewidth and Minimum Fill-in: Grouping the Minimal SeparatorsSIAM Journal on Computing, 2001
- Listing all Minimal Separators of a GraphSIAM Journal on Computing, 1998
- Efficient enumeration of all minimal separators in a graphTheoretical Computer Science, 1997
- On generating all maximal independent setsInformation Processing Letters, 1988
- An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per CutsetJournal of the ACM, 1980