Tree Decompositions with Small Cost
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Computing the Treewidth and the Minimum Fill-in with the Modular Decomposition
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
-Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Approximating the treewidth of AT-free graphs
Discrete Applied Mathematics - Special issue: The second international colloquium, "journées de l'informatique messine"
Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
Journal of Computer and System Sciences
Discovering patterns of medical practice in large administrative health databases
Data & Knowledge Engineering
Tree decompositions with small cost
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Computing the branchwidth of interval graphs
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Improved approximation algorithms for minimum-weight vertex separators
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Computing minimal triangulations in time O(nα log n) = o(n2.376)
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Space Complexity of Estimation of Distribution Algorithms
Evolutionary Computation
On exact algorithms for treewidth
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Characterizing and Computing Minimal Cograph Completions
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
Theoretical Computer Science
Discrete Applied Mathematics
Computing branchwidth via efficient triangulations and blocks
Discrete Applied Mathematics
Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Exponential time algorithms for the minimum dominating set problem on some graph classes
ACM Transactions on Algorithms (TALG)
Tree decompositions with small cost
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Computing the branchwidth of interval graphs
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Approximating the treewidth of AT-free graphs
Discrete Applied Mathematics
On the complexity of computing treelength
Discrete Applied Mathematics
Characterizing and computing minimal cograph completions
Discrete Applied Mathematics
Treewidth: structure and algorithms
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Characterizing minimal interval completions towards better understanding of profile and pathwidth
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
A characterisation of the minimal triangulations of permutation graphs
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Space-optimal, backtracking algorithms to list the minimal vertex separators of a graph
Discrete Applied Mathematics
Treewidth and minimum fill-in on permutation graphs in linear time
Theoretical Computer Science
Strongly chordal and chordal bipartite graphs are sandwich monotone
Journal of Combinatorial Optimization
Exact algorithm for the maximum induced planar subgraph problem
ESA'11 Proceedings of the 19th European conference on Algorithms
Treewidth: characterizations, applications, and computations
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Subexponential parameterized algorithm for minimum fill-in
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Treewidth lower bounds with brambles
ESA'05 Proceedings of the 13th annual European conference on Algorithms
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Computing hypergraph width measures exactly
Information Processing Letters
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Computing treewidth and minimum fill-in for permutation graphs in linear time
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Computing branchwidth via efficient triangulations and blocks
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
A parameterized algorithm for chordal sandwich
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Improved exponential-time algorithms for treewidth and minimum fill-in
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Fixed-Parameter tractability of treewidth and pathwidth
The Multivariate Algorithmic Revolution and Beyond
Minimal separators in extended P4-laden graphs
Discrete Applied Mathematics
On exact algorithms for treewidth
ACM Transactions on Algorithms (TALG)
On the complexity of computing treelength
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
| 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. We prove that for all classes of graphs for which polynomial algorithms computing the treewidth and the minimum fill-in exist, we can list their potential maximal cliques in polynomial time. Our approach unifies these algorithms. Finally we show how to compute in polynomial time the potential maximal cliques of weakly triangulated graphs for which the treewidth and the minimum fill-in problems were open.