Properties of Gomory-Hu co-cycle bases
From MaRDI portal
Publication:764362
DOI10.1016/J.TCS.2011.11.003zbMATH Open1241.05057OpenAlexW2075330615MaRDI QIDQ764362FDOQ764362
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
Recommendations
Cites Work
- Minimum weakly fundamental cycle bases are hard to find
- A data structure for dynamic trees
- Beyond the flow decomposition barrier
- Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs
- A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
- Algorithms for Generating Fundamental Cycles in a Graph
- Cycle bases in graphs characterization, algorithms, complexity, and applications
- Minimum cycle bases, faster and simpler
- Title not available (Why is that?)
- Multi-Terminal Network Flows
- Minimum cycle bases for network graphs
- Automata, Languages and Programming
- Integral cycle bases for cyclic timetabling
- Title not available (Why is that?)
- Finding short integral cycle bases for cyclic timetabling
- Very Simple Methods for All Pairs Network Flow Analysis
- Breaking the O(m 2 n) Barrier for Minimum Cycle Bases
- A greedy approach to compute a minimum cycle basis of a directed graph
- Title not available (Why is that?)
- The All-Pairs Min Cut Problem and the Minimum Cycle Basis Problem on Planar Graphs
- Classes of cycle bases
- Minimum cut bases in undirected networks
- Algorithms to compute minimum cycle basis in directed graphs
- Cycle bases of minimal measure for the structural analysis of skeletal structures by the flexibility method
- Automata, Languages and Programming
Cited In (2)
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)
