Minimum cut bases in undirected networks

DOI10.1016/J.DAM.2009.07.015MaRDI QIDQ968141zbMATH OpenOpenAlexFDO

Authors Florentine Bunke, Horst W. Hamacher, Francesco Maffioli, Anne Schwahn

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

zbMATH Keywords

integer programmingcut basis problemgraph and network algorithms

Mathematics Subject Classification ID

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)

Recommendations

• scientific article; zbMATH DE number 2080984
• On a Special Co-cycle Basis of Graphs
• Properties of Gomory-Hu co-cycle bases
• Approximation and Online Algorithms
• Cuts in undirected graphs. II

Cites work

• scientific article; zbMATH DE number 2089223 (Why is no real title available?)
• scientific article; zbMATH DE number 3167398 (Why is no real title available?)
• scientific article; zbMATH DE number 3741435 (Why is no real title available?)
• scientific article; zbMATH DE number 3609444 (Why is no real title available?)
• scientific article; zbMATH DE number 1145916 (Why is no real title available?)
• scientific article; zbMATH DE number 2080984 (Why is no real title available?)
• A Graph-Theoretic Game and Its Application to the k-Server Problem
• A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
• Algorithms for Generating Fundamental Cycles in a Graph
• Approximation and Online Algorithms
• Automata, Languages and Programming
• Benchmarks for Strictly Fundamental Cycle Bases
• Beyond the flow decomposition barrier
• Cycle bases from orderings and coverings
• Edge-swapping algorithms for the minimum fundamental cycle basis problem
• Minimum cut bases in undirected networks
• Multi-Terminal Network Flows
• On a Special Co-cycle Basis of Graphs
• On cycle bases of a graph
• On the approximability of the minimum strictly fundamental cycle basis problem
• On the cycle polytope of a binary matroid
• On the minimum diameter spanning tree problem
• The zoo of tree spanner problems
• Very Simple Methods for All Pairs Network Flow Analysis

Cited in

(12)

• Minimal graph cuts on network subgraphs
• An algorithm for computing maximum solution bases
• Minimum spanning tree cycle intersection problem on outerplanar graphs
• Properties of Gomory-Hu co-cycle bases
• Cuts in undirected graphs. II
• Graph cuts with interacting edge weights: examples, approximations, and algorithms
• Computing All Small Cuts in an Undirected Network
• On a Special Co-cycle Basis of Graphs
• Mimicking Networks and Succinct Representations of Terminal Cuts
• All-Pairs Min-Cut in Sparse Networks
• Cyclic matrices of weighted digraphs
• Minimum cut bases in undirected networks

Describes a project that uses

Uses Software

• XPRESS

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)