Automata, Languages and Programming

DOI10.1007/b99859zbMath1099.68076OpenAlexW2505584480MaRDI QIDQ5466494

Ioan Todinca, Dieter Kratsch, Fedor V. Fomin

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

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

Related Items (16)

Minimal triangulations of graphs: a survey ⋮ Approximation algorithms for treewidth ⋮ Treewidth computation and extremal combinatorics ⋮ Tangle bases: Revisited ⋮ Characterizing and Computing Minimal Cograph Completions ⋮ On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints ⋮ Treewidth lower bounds with brambles ⋮ Distributed chasing of network intruders ⋮ Solving connected dominating set faster than \(2^n\) ⋮ Tree decomposition and discrete optimization problems: a survey ⋮ A note on exact algorithms for vertex ordering problems on graphs ⋮ Computing branchwidth via efficient triangulations and blocks ⋮ Characterizing and computing minimal cograph completions ⋮ Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions ⋮ Nondeterministic graph searching: from pathwidth to treewidth ⋮ Learning tractable Bayesian networks in the space of elimination orders

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