Computing mimicking networks
From MaRDI portal
Publication:1969941
DOI10.1007/s004539910003zbMath0949.68166OpenAlexW3160409744MaRDI QIDQ1969941
Publication date: 19 March 2000
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s004539910003
Related Items (7)
Tight Bounds for Gomory-Hu-like Cut Counting ⋮ On mimicking networks representing minimum terminal cuts ⋮ Worst-case ratios of networks in the rectilinear plane ⋮ Refined Vertex Sparsifiers of Planar Graphs ⋮ Improved Guarantees for Vertex Sparsification in Planar Graphs ⋮ Faster algorithms for shortest path and network flow based on graph decomposition ⋮ NC Algorithms for Computing a Perfect Matching and a Maximum Flow in One-Crossing-Minor-Free Graphs
This page was built for publication: Computing mimicking networks
