Flow Hypergraph Reducibility

DOI10.1016/j.endm.2008.01.044zbMath1341.05178OpenAlexW1984271254MaRDI QIDQ3503561

No author found.

Publication date: 5 June 2008

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2008.01.044

zbMATH Keywords

reducible flow graphs

Mathematics Subject Classification ID

Hypergraphs (05C65) Signed and weighted graphs (05C22)

Cites Work

• Unnamed Item
• Solving problems for maximal reducible flowgraphs.
• Directed hypergraphs and applications
• A Linear Time Algorithm for Finding Minimum Cutsets in Reducible Graphs
• Characterizations of Reducible Flow Graphs
• Flow Graph Reducibility
• The complexity of arc-colorings for directed hypergraphs

This page was built for publication: Flow Hypergraph Reducibility