Properties of Gomory-Hu co-cycle bases

DOI10.1016/J.TCS.2011.11.003MaRDI QIDQ764362zbMATH OpenOpenAlexFDO

Authors Telikepalli Kavitha

Publication date 13 March 2012

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2011.11.003

zbMATH Keywords

cutsco-cyclesGomory-Hu tree

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38)

Recommendations

• On a Special Co-cycle Basis of Graphs
• Algorithms to compute minimum cycle basis in directed graphs
• Minimum cut bases in undirected networks
• Minimum Cycle Bases in Graphs Algorithms and Applications
• Minimum Cycle Bases and Their Applications

Cites work

• Title not available (Why is no real title available?)
• scientific article; zbMATH DE number 2089223 (Why is no real title available?)
• scientific article; zbMATH DE number 3839870 (Why is no real title available?)
• scientific article; zbMATH DE number 1234104 (Why is no real title available?)
• A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
• A data structure for dynamic trees
• A greedy approach to compute a minimum cycle basis of a directed graph
• Algorithms for Generating Fundamental Cycles in a Graph
• Algorithms to compute minimum cycle basis in directed graphs
• Automata, Languages and Programming
• Automata, Languages and Programming
• Beyond the flow decomposition barrier
• Breaking the O(m 2 n) Barrier for Minimum Cycle Bases
• Classes of cycle bases
• Cycle bases in graphs characterization, algorithms, complexity, and applications
• Cycle bases of minimal measure for the structural analysis of skeletal structures by the flexibility method
• Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs
• Finding short integral cycle bases for cyclic timetabling
• Integral cycle bases for cyclic timetabling
• Minimum cut bases in undirected networks
• Minimum cycle bases for network graphs
• Minimum weakly fundamental cycle bases are hard to find
• Multi-Terminal Network Flows
• The All-Pairs Min Cut Problem and the Minimum Cycle Basis Problem on Planar Graphs
• Very Simple Methods for All Pairs Network Flow Analysis

Cited in

(2)

• Minimum cut bases in undirected networks
• On a Special Co-cycle Basis of Graphs

This page was built for publication: Properties of Gomory-Hu co-cycle bases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q764362)