Automata, Languages and Programming

DOI10.1007/B99859MaRDI QIDQ5466494zbMATH OpenOpenAlexFDO

Authors Fedor V. Fomin, Dieter Kratsch, Ioan Todinca

Publication date 24 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b99859

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Exact Algorithms for Treewidth and Minimum Fill-In
• Improved Exponential-Time Algorithms for Treewidth and Minimum Fill-In
• On Exact Algorithms for Treewidth
• On exact algorithms for treewidth
• A revisit of the scheme for computing treewidth and minimum fill-in
• Branching and Treewidth Based Exact Algorithms
• Approximation algorithms for treewidth
• Computing the Treewidth and the Minimum Fill-in with the Modular Decomposition
• Computing the treewidth and the minimum fill-in with the modular decomposition

Cited in

(27)

• Learning tractable Bayesian networks in the space of elimination orders
• Characterizing and computing minimal cograph completions
• Exact Algorithms for Treewidth and Minimum Fill-In
• Tree decomposition and discrete optimization problems: a survey
• A note on exact algorithms for vertex ordering problems on graphs
• On Exact Algorithms for Treewidth
• Treewidth computation and extremal combinatorics
• Approximation algorithms for treewidth
• Treewidth lower bounds with brambles
• Minimal triangulations of graphs: a survey
• Computing branchwidth via efficient triangulations and blocks
• Characterizing and Computing Minimal Cograph Completions
• On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints
• Treewidth Computation and Extremal Combinatorics
• Tangle bases: Revisited
• Solving graph problems via potential maximal cliques: an experimental evaluation of the Bouchitté-Todinca algorithm
• Graph-Theoretic Concepts in Computer Science
• On exact algorithms for treewidth
• Computing the Treewidth and the Minimum Fill-in with the Modular Decomposition
• Solving connected dominating set faster than \(2^n\)
• Improved Exponential-Time Algorithms for Treewidth and Minimum Fill-In
• Distributed chasing of network intruders
• Nondeterministic graph searching: from pathwidth to treewidth
• A revisit of the scheme for computing treewidth and minimum fill-in
• Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions
• Treewidth and minimum fill-in: Grouping the minimal separators
• Computing the treewidth and the minimum fill-in with the modular decomposition

This page was built for publication: Automata, Languages and Programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5466494)