Solving problems for maximal reducible flowgraphs.
From MaRDI portal
Publication:1427189
DOI10.1016/S0166-218X(03)00449-9zbMath1035.05046MaRDI QIDQ1427189
Lilian Markenzon, Oswaldo Vernet
Publication date: 14 March 2004
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C20: Directed graphs (digraphs), tournaments
05C45: Eulerian and Hamiltonian graphs
Cites Work
- A Minimax Arc Theorem for Reducible Flow Graphs
- On digraphs with a rooted tree structure
- Finding a minimum feedback arc set in reducible flow graphs
- A Linear Time Algorithm for Finding Minimum Cutsets in Reducible Graphs
- Characterizations of Reducible Flow Graphs
- Flow Graph Reducibility
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item