scientific article; zbMATH DE number 1775390

zbMath1028.68106MaRDI QIDQ4542522

Matthew S. Levine, David R. Karger

Publication date: 1 August 2002

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (14)

On computing minimum\((s,t)\)-cuts in digraphs ⋮ Recent developments in maximum flow algorithms ⋮ An improved parameterized algorithm for the minimum node multiway cut problem ⋮ Unit Capacity Maxflow in Almost $m^{4/3}$ Time ⋮ On flows in simple bidirected and skew-symmetric networks ⋮ Pushdown-reduce: An algorithm for connectivity augmentation and poset covering problems ⋮ Reconstructing edge-disjoint paths. ⋮ A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO) ⋮ Graph connectivity and its augmentation: Applications of MA orderings ⋮ Maximum bipartite flow in networks with adaptive channel width ⋮ Short length Menger's theorem and reliable optical routing ⋮ A fast algorithm for the path 2-packing problem ⋮ Reconstructing edge-disjoint paths faster ⋮ Fast Augmenting Paths by Random Sampling from Residual Graphs

This page was built for publication: