scientific article; zbMATH DE number 871922
From MaRDI portal
Publication:4875193
zbMATH Open0852.68036MaRDI QIDQ4875193FDOQ4875193
Andrei Broder, Eli Upfal, Alan Frieze, Stephen Suen
Publication date: 11 December 1996
Title of this publication is not available (Why is that?)
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)
Cited In (18)
- An Exact Sublinear Algorithm for the Max-Flow, Vertex Disjoint Paths and Communication Problems on Random Graphs
- Perfect matching in random graphs is as hard as Tseitin
- Efficient algorithms for minimal disjoint path problems on chordal graphs
- Title not available (Why is that?)
- Efficient algorithms with performance guarantees for some problems of finding several discrete disjoint subgraphs in complete weighted graph
- A LOWER BOUND OF THE EXPECTED MAXIMUM NUMBER OF VERTEX-DISJOINT s-t PATHS ON PROBABILISTIC GRAPHS
- Towards the Erdős-Gallai cycle decomposition conjecture
- Spanning trees in random graphs
- Constructing disjoint paths for secure communication
- A Stabilizing Algorithm for Finding Two Node-Disjoint Paths in Arbitrary Networks
- Decomposing Random Graphs into Few Cycles and Edges
- Cuts and Disjoint Paths in the Valley-Free Path Model
- Towards the Erdős-Gallai cycle decomposition conjecture
- Improved Algorithms for the 2-Vertex Disjoint Paths Problem
- Title not available (Why is that?)
- Constructing disjoint paths on expander graphs
- Title not available (Why is that?)
- Rolling backwards can move you forward: On embedding problems in sparse expanders
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 Q4875193)
