Treewidth of Circular-Arc Graphs
SIAM Journal on Discrete Mathematics
Algorithms for weakly triangulated graphs
Discrete Applied Mathematics
Treewidth and Pathwidth of Permutation Graphs
ICALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming
How to Use the Minimal Separators of a Graph for its Chordal Triangulation
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
ISAAC '93 Proceedings of the 4th International Symposium on Algorithms and Computation
Finding All Minimal Separators of a Graph
STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
Computing Treewidth and Minimum Fill-In: All You Need are the Minimal Separators
ESA '93 Proceedings of the First Annual European Symposium on Algorithms
Listing All Potential Maximal Cliques of a Graph
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Generating All the Minimal Separators of a Graph
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Approximating the Treewidth of AT-Free Graphs
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
| Hi-index | 0.00 |
We give a characterization of minimal triangulation of graphs using the notion of "maximal set of neighbor separators". We prove that if all the maximal sets of neighbor separators of some graphs can be computed in polynomial time, the treewidth of those graphs can be computed in polynomial time. This notion also unifies the already known algorithms computing the treewidth of several classes of graphs.