Solving problems for maximal reducible flowgraphs.

DOI10.1016/S0166-218X(03)00449-9zbMath1035.05046MaRDI QIDQ1427189

Oswaldo Vernet, Lilian Markenzon

Publication date: 14 March 2004

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

Hamiltonian pathsIsomorphismFeedback arc setReducible flowgraphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

Flow Hypergraph Reducibility ⋮ Flow hypergraph reducibility

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

This page was built for publication: Solving problems for maximal reducible flowgraphs.