Treewidth of Circular-Arc Graphs
SIAM Journal on Discrete Mathematics
Algorithms for weakly triangulated graphs
Discrete Applied Mathematics
Treewidth of chordal bipartite graphs
Journal of Algorithms
On treewidth and minimum fill-in of asteroidal triple-free graphs
Ordal'94 Selected papers from the conference on Orders, algorithms and applications
Characterizations and algorithmic applications of chordal graph embeddings
Proceedings of the 4th Twente workshop on Graphs and combinatorial optimization
Minimum fill-in on circle and circular-arc graphs
Journal of Algorithms
ISAAC '93 Proceedings of the 4th International Symposium on Algorithms and Computation
Algorithms for Maximum Matching and Minimum Fill-in on Chordal Bipartite Graphs
ISAAC '96 Proceedings of the 7th International Symposium on Algorithms and Computation
Algorithms for the Treewidth and Minimum Fill-in of HHD-Free Graphs
WG '97 Proceedings of the 23rd International Workshop on Graph-Theoretic Concepts in 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
Approximating the Bandwidth for Asteroidal Triple-Free Graphs
ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Listing all potential maximal cliques of a graph
Theoretical Computer Science
Recognizing weakly triangulated graphs by edge separability
Nordic Journal of Computing
Listing All Potential Maximal Cliques of a Graph
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Approximating the Treewidth of AT-Free Graphs
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
Recognizing Weakly Triangulated Graphs by Edge Separability
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
The PIGs full monty – a floor show of minimal separators
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
| Hi-index | 0.00 |
We use the notion of potential maximal clique to characterize the maximal cliques appearing in minimal triangulations of a graph. We show that if these objects can be listed in polynomial time for a class of graphs, the treewidth and the minimum fill-in are polynomially tractable for these graphs. Finally we show how to compute in polynomial time the potential maximal cliques of weakly triangulated graphs.