Mathematical Foundations of Computer Science 2005

DOI10.1007/11549345MaRDI QIDQ5492905zbMATH OpenOpenAlexFDO

Authors MohammadAli Safari

Publication date 20 October 2006

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

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

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Directed tree-width
• Digraphs of bounded width
• Are there any good digraph width measures?
• Directed tree-width examples
• Are there any good digraph width measures?

Cited in

(35)

• Standard directed search strategies and their applications
• Directed tree-width
• Digraph width measures in parameterized algorithmics
• Directed tree-width examples
• An algorithmic metatheorem for directed treewidth
• Introducing directed tree width
• Are there any good digraph width measures?
• LIFO-search on digraphs: a searching game for cycle-rank
• A Polynomial Time Algorithm for Bounded Directed Pathwidth
• Digraphs of bounded width
• DAG-width is PSPACE-complete
• Characterization and Recognition of Digraphs of Bounded Kelly-width
• Directed one-trees
• On digraph width measures in parameterized algorithmics
• The dag-width of directed graphs
• scientific article; zbMATH DE number 7378361 (Why is no real title available?)
• Forbidden directed minors and Kelly-width
• Algorithmic properties of sparse digraphs
• Directed path-decompositions
• Digraph Decompositions and Monotonicity in Digraph Searching
• Undirected Graphs of Entanglement 2
• Directed nowhere dense classes of graphs
• Spined categories: generalizing tree-width beyond graphs
• Digraph decompositions and monotonicity in digraph searching
• Redicolouring digraphs: directed treewidth and cycle-degeneracy
• Dualities in graphs and digraphs
• Witnessing subsystems for probabilistic systems with low tree width
• LIFO-search: a min-max theorem and a searching game for cycle-rank and tree-depth
• Computing the zig-zag number of directed graphs
• Are there any good digraph width measures?
• Directed elimination games
• Digraph measures: Kelly decompositions, games, and orderings
• Digraph searching, directed vertex separation and directed pathwidth
• Monotonicity in digraph search problems
• Recognizing digraphs of Kelly-width 2

This page was built for publication: Mathematical Foundations of Computer Science 2005

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