Characterization and Recognition of Digraphs of Bounded Kelly-width

DOI10.1007/978-3-540-74839-7_26zbMath1141.68545OpenAlexW1508778805MaRDI QIDQ3508574

Jan Arne Telle, Martin Vatshelle, Daniel Meister

Publication date: 1 July 2008

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74839-7_26

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) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

Chordal digraphs ⋮ Characterization and Recognition of Digraphs of Bounded Kelly-width

Cites Work

• Directed tree-width
• Characterization and Recognition of Digraphs of Bounded Kelly-width
• Treewidth: Characterizations, Applications, and Computations
• DAG-width
• DAG-Width and Parity Games
• Mathematical Foundations of Computer Science 2005
• Unnamed Item

This page was built for publication: Characterization and Recognition of Digraphs of Bounded Kelly-width