scientific article; zbMATH DE number 1775390
From MaRDI portal
Publication:4542522
zbMATH Open1028.68106MaRDI QIDQ4542522FDOQ4542522
Authors: Matthew S. Levine, David R. Karger 
Publication date: 1 August 2002
Title of this publication is not available (Why is that?)
Recommendations
Cited In (18)
- Title not available (Why is that?)
- On computing minimum\((s,t)\)-cuts in digraphs
- Maximum bipartite flow in networks with adaptive channel width
- Pushdown-reduce: An algorithm for connectivity augmentation and poset covering problems
- On flows in simple bidirected and skew-symmetric networks
- Reconstructing edge-disjoint paths.
- Short length Menger's theorem and reliable optical routing
- Reconstructing edge-disjoint paths faster
- A fast algorithm for the path 2-packing problem
- Maximum skew-symmetric flows and matchings
- Solving Maximum Flow Problems on Real World Bipartite Graphs
- Breaking the \(O(n^{2.5})\) deterministic time barrier for undirected unit-capacity maximum flow
- Graph connectivity and its augmentation: Applications of MA orderings
- Fast augmenting paths by random sampling from residual graphs
- A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO)
- An improved parameterized algorithm for the minimum node multiway cut problem
- Unit Capacity Maxflow in Almost $m^{4/3}$ Time
- Recent developments in maximum flow algorithms
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4542522)
