Characterizing the flow equivalent trees of a network

DOI10.1016/S0166-218X(02)00501-2zbMath1021.05024MaRDI QIDQ1811121

David B. Hartvigsen

Publication date: 10 June 2003

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

zbMATH Keywords

spanning treeflow equivalent treemax flow

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Canonical cactus representation for miminum cuts
• Efficient algorithm for finding all minimal edge cuts of a nonoriented graph
• Multi-Terminal Network Flows
• On the decomposition ofkn into complete bipartite graphs
• The Minimum Number of Edges and Vertices in a Graph with Edge Connectivity n and m n‐Bonds
• Building Chain and Cactus Representations of All Minimum Cuts from Hao–Orlin in the Same Asymptotic Run Time
• On the Addressing Problem for Loop Switching
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Characterizing the flow equivalent trees of a network