Computing the zig-zag number of directed graphs
DOI10.1016/J.DAM.2021.09.013zbMATH Open1485.05072OpenAlexW3202990525MaRDI QIDQ831867FDOQ831867
Authors: Mitre C. Dourado, Alexsander A. de Melo, Mateus de Oliveira Oliveira, Uéverton S. Souza, Celina M. H. de Figueiredo 
Publication date: 24 March 2022
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2021.09.013
Recommendations
Trees (05C05) Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- A partial k-arboretum of graphs with bounded treewidth
- Directed tree-width
- Entanglement and the complexity of directed graphs
- Linear time solvable optimization problems on graphs of bounded clique-width
- Directed path-width and monotonicity in digraph searching
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- An algorithmic metatheorem for directed treewidth
- Introducing directed tree width
- Subgraphs satisfying MSO properties on \(z\)-topologically orderable digraphs
- A Polynomial Time Algorithm for Bounded Directed Pathwidth
- Finite Automata, Digraph Connectivity, and Regular Expression Size
- The dag-width of directed graphs
- Hamilton Paths in Grid Graphs
- The complexity of satisfiability problems
- Mathematical Foundations of Computer Science 2005
- Digraph measures: Kelly decompositions, games, and orderings
- Digraph searching, directed vertex separation and directed pathwidth
- On digraph width measures in parameterized algorithmics
- Are there any good digraph width measures?
This page was built for publication: Computing the zig-zag number of directed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q831867)
