Mathematical Foundations of Computer Science 2005

DOI10.1007/11549345zbMath1156.05304OpenAlexW2494705596MaRDI QIDQ5492905

Mohammad Ali 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)

Related Items (28)

An algorithmic metatheorem for directed treewidth ⋮ Computing the zig-zag number of directed graphs ⋮ Digraph Decompositions and Monotonicity in Digraph Searching ⋮ DAG-width is PSPACE-complete ⋮ Spined categories: generalizing tree-width beyond graphs ⋮ Are there any good digraph width measures? ⋮ Directed elimination games ⋮ Characterization and Recognition of Digraphs of Bounded Kelly-width ⋮ Unnamed Item ⋮ Digraph decompositions and monotonicity in digraph searching ⋮ The dag-width of directed graphs ⋮ Digraph width measures in parameterized algorithmics ⋮ Digraph measures: Kelly decompositions, games, and orderings ⋮ Digraph searching, directed vertex separation and directed pathwidth ⋮ Forbidden directed minors and Kelly-width ⋮ Monotonicity in digraph search problems ⋮ Recognizing digraphs of Kelly-width 2 ⋮ LIFO-search: a min-max theorem and a searching game for cycle-rank and tree-depth ⋮ Unnamed Item ⋮ Are There Any Good Digraph Width Measures? ⋮ Undirected Graphs of Entanglement 2 ⋮ Directed Path-Decompositions ⋮ LIFO-Search on Digraphs: A Searching Game for Cycle-Rank ⋮ Standard directed search strategies and their applications ⋮ A Polynomial Time Algorithm for Bounded Directed Pathwidth ⋮ On Digraph Width Measures in Parameterized Algorithmics ⋮ Digraphs of Bounded Width ⋮ Unnamed Item

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