Flow hypergraph reducibility

DOI10.1016/j.dam.2011.02.006zbMath1228.05165OpenAlexW2173194027MaRDI QIDQ643016

Juan-Miguel Gracia

Publication date: 27 October 2011

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

Full work available at URL: https://doi.org/10.1016/j.dam.2011.02.006

zbMATH Keywords

directed hypergraphsflowgraphsgraph reducibility

Mathematics Subject Classification ID

Hypergraphs (05C65) Flows in graphs (05C21)

Related Items (1)

Finding hypernetworks in directed hypergraphs

Cites Work

• Unnamed Item
• Linear connectivity problems in directed hypergraphs
• Testing flow graph reducibility
• Solving problems for maximal reducible flowgraphs.
• A directed hypergraph model for random time dependent shortest paths
• Directed hypergraphs and applications
• A note on minimum makespan assembly plans
• A Linear Time Algorithm for Finding Minimum Cutsets in Reducible Graphs
• Characterizations of Reducible Flow Graphs
• Flow Graph Reducibility
• Some Properties of Conversion
• The complexity of arc-colorings for directed hypergraphs

This page was built for publication: Flow hypergraph reducibility