FPT algorithms to enumerate and count acyclic and totally cyclic orientations
From MaRDI portal
Publication:2132402
DOI10.1016/j.entcs.2019.08.057OpenAlexW2977338727WikidataQ113317372 ScholiaQ113317372MaRDI QIDQ2132402
Hiroshi Imai, Farley Soares Oliveira, Hidefumi Hiraishi
Publication date: 27 April 2022
Full work available at URL: https://doi.org/10.1016/j.entcs.2019.08.057
acyclic orientationsparameterized algorithmsbinary decision diagrampath-widthbranch-widthFPT algorithmstotally cyclic orientations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generating all the acyclic orientations of an undirected graph
- Spanning trees and orientation of graphs
- Some inequalities for the Tutte polynomial
- Graph minors. X: Obstructions to tree-decomposition
- Acyclic and totally cyclic orientations of combinatorial geometries
- A partial k-arboretum of graphs with bounded treewidth
- FPT algorithms exploiting carving decomposition for Eulerian orientations and ice-type models
- Reverse search for enumeration
- A note on spanning trees and totally cyclic orientations of 3-connected graphs
- Acyclic orientations of graphs
- The Merino-Welsh conjecture holds for series-parallel graphs
- Listing Acyclic Orientations of Graphs with Single and Multiple Sources
- Directing Road Networks by Listing Strong Orientations
- Faster Computation of Path-Width
- On the Interpretation of Whitney Numbers Through Arrangements of Hyperplanes, Zonotopes, Non-Radon Partitions, and Orientations of Graphs
- Graph-Based Algorithms for Boolean Function Manipulation
- Asymptotic Enumeration of Partial Orders on a Finite Set
- Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width
- The Computational Complexity of the Tutte Plane: the Bipartite Case
- Generating the Acyclic Orientations of a Graph
- Constructive linear time algorithms for branchwidth
This page was built for publication: FPT algorithms to enumerate and count acyclic and totally cyclic orientations
