Minimum cut bases in undirected networks
DOI10.1016/J.DAM.2009.07.015zbMATH Open1226.05231OpenAlexW2001281476MaRDI QIDQ968141FDOQ968141
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
Recommendations
Deterministic network models in operations research (90B10) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Integer programming (90C10) Signed and weighted graphs (05C22) Paths and cycles (05C38)
Cites Work
- Beyond the flow decomposition barrier
- A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
- Algorithms for Generating Fundamental Cycles in a Graph
- On the approximability of the minimum strictly fundamental cycle basis problem
- Multi-Terminal Network Flows
- Title not available (Why is that?)
- A Graph-Theoretic Game and Its Application to the k-Server Problem
- Automata, Languages and Programming
- Very Simple Methods for All Pairs Network Flow Analysis
- On the cycle polytope of a binary matroid
- On the minimum diameter spanning tree problem
- Title not available (Why is that?)
- On cycle bases of a graph
- The zoo of tree spanner problems
- Minimum cut bases in undirected networks
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximation and Online Algorithms
- Edge-swapping algorithms for the minimum fundamental cycle basis problem
- Cycle bases from orderings and coverings
- On a Special Co-cycle Basis of Graphs
- Title not available (Why is that?)
- Benchmarks for Strictly Fundamental Cycle Bases
Cited In (11)
- Minimum cut bases in undirected networks
- Cyclic matrices of weighted digraphs
- Minimal graph cuts on network subgraphs
- Computing All Small Cuts in an Undirected Network
- Minimum spanning tree cycle intersection problem on outerplanar graphs
- Graph cuts with interacting edge weights: examples, approximations, and algorithms
- Properties of Gomory-Hu co-cycle bases
- Mimicking Networks and Succinct Representations of Terminal Cuts
- On a Special Co-cycle Basis of Graphs
- An algorithm for computing maximum solution bases
- All-Pairs Min-Cut in Sparse Networks
Uses Software
This page was built for publication: Minimum cut bases in undirected networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968141)
