scientific article; zbMATH DE number 1559539

MaRDI QIDQ4526987zbMATH OpenFDO

Authors David R. Karger

Publication date 28 February 2001

zbMATH Keywords

random samplingundirected uncapacitated graphs

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1303591
• Fast augmenting paths by random sampling from residual graphs
• Flows in Undirected Unit Capacity Networks
• A new approach to computing maximum flows using electrical flows
• scientific article; zbMATH DE number 1775390

Cited in

(9)

• Random sampling and greedy sparsification for matroid optimization problems
• Random sampling in cut, flow, and network design problems
• scientific article; zbMATH DE number 1303591 (Why is no real title available?)
• Recent developments in maximum flow algorithms
• Unit Capacity Maxflow in Almost $m^{4/3}$ Time
• Fast augmenting paths by random sampling from residual graphs
• Maximum bipartite flow in networks with adaptive channel width
• Deterministic maximum flows in simple graphs
• On computing minimum(s,t)-cuts in digraphs

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 Q4526987)