scientific article; zbMATH DE number 871922
From MaRDI portal
Publication:4875193
Recommendations
Cited in
(24)- Constructing disjoint paths on expander graphs
- Spanning trees in random graphs
- Simultaneous disjoint routing in regular graphs
- Efficient algorithms with performance guarantees for some problems of finding several discrete disjoint subgraphs in complete weighted graph
- Polynomial time algorithm for constructing vertex-disjoint paths in transposition graphs
- scientific article; zbMATH DE number 1003293 (Why is no real title available?)
- scientific article; zbMATH DE number 3883622 (Why is no real title available?)
- scientific article; zbMATH DE number 4205963 (Why is no real title available?)
- Improved Algorithms for the 2-Vertex Disjoint Paths Problem
- An Exact Sublinear Algorithm for the Max-Flow, Vertex Disjoint Paths and Communication Problems on Random Graphs
- Optimal Construction of Edge-Disjoint Paths in Random Graphs
- A LOWER BOUND OF THE EXPECTED MAXIMUM NUMBER OF VERTEX-DISJOINT s-t PATHS ON PROBABILISTIC GRAPHS
- scientific article; zbMATH DE number 2030041 (Why is no real title available?)
- Short vertex disjoint paths and multiconnectivity in random graphs: reliable network computing
- Efficient algorithms for minimal disjoint path problems on chordal graphs
- Rolling backwards can move you forward: on embedding problems in sparse expanders
- 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
- Constructing disjoint paths for secure communication
- Towards the Erdős-Gallai cycle decomposition conjecture
- Towards the Erdős-Gallai cycle decomposition conjecture
- Perfect matching in random graphs is as hard as Tseitin
- Edge-disjoint paths in expanders: online with removals
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)
