Minimum cut bases in undirected networks
From MaRDI portal
Publication:968141
DOI10.1016/j.dam.2009.07.015zbMath1226.05231OpenAlexW2001281476MaRDI QIDQ968141
Francesco Maffioli, Horst W. Hamacher, Anne Schwahn, Florentine Bunke
Publication date: 5 May 2010
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2009.07.015
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Integer programming (90C10) Deterministic network models in operations research (90B10) Paths and cycles (05C38) Signed and weighted graphs (05C22)
Related Items
On a Special Co-cycle Basis of Graphs, Minimum spanning tree cycle intersection problem on outerplanar graphs, Graph cuts with interacting edge weights: examples, approximations, and algorithms, Minimum cut bases in undirected networks, Properties of Gomory-Hu co-cycle bases, Cyclic matrices of weighted digraphs
Uses Software
Cites Work
- On the approximability of the minimum strictly fundamental cycle basis problem
- On the minimum diameter spanning tree problem
- Minimum cut bases in undirected networks
- Edge-swapping algorithms for the minimum fundamental cycle basis problem
- On the cycle polytope of a binary matroid
- Cycle bases from orderings and coverings
- The zoo of tree spanner problems
- Beyond the flow decomposition barrier
- On cycle bases of a graph
- Very Simple Methods for All Pairs Network Flow Analysis
- On a Special Co-cycle Basis of Graphs
- A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
- Multi-Terminal Network Flows
- Algorithms for Generating Fundamental Cycles in a Graph
- A Graph-Theoretic Game and Its Application to the k-Server Problem
- Benchmarks for Strictly Fundamental Cycle Bases
- Automata, Languages and Programming
- Approximation and Online Algorithms
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
