Optimal Construction of Edge-Disjoint Paths in Random Graphs-Reference-Cited by-同舟云学术

Optimal Construction of Edge-Disjoint Paths in Random Graphs

Published:1998-01 Issue:2 Volume:28 Page:541-573
ISSN:0097-5397
Container-title:SIAM Journal on Computing
language:en
Short-container-title:SIAM J. Comput.

Author:

Broder Andrei Z.,Frieze Alan M.,Suen Stephen,Upfal Eli

Publisher

Society for Industrial & Applied Mathematics (SIAM)

Subject

General Mathematics,General Computer Science

Link

http://epubs.siam.org/doi/pdf/10.1137/S0097539795290805

Reference10 articles.

1. The asymptotic number of labeled graphs with given degree sequences

2. A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs

3. Existence and Construction of Edge-Disjoint Paths on Expander Graphs

4. A theorem on flows in networks

Cited by 25 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Spectral Gap and Edge Universality of Dense Random Regular Graphs;Communications in Mathematical Physics;2024-07-23

2. Blockchain-based Transaction Group Key Management Scheme For Edge Devices;2023 IEEE International Conferences on Internet of Things (iThings) and IEEE Green Computing & Communications (GreenCom) and IEEE Cyber, Physical & Social Computing (CPSCom) and IEEE Smart Data (SmartData) and IEEE Congress on Cybermatics (Cybermatics);2023-12-17

3. The spectral gap of random regular graphs;Random Structures & Algorithms;2023-04-11

4. Global eigenvalue fluctuations of random biregular bipartite graphs;Random Matrices: Theory and Applications;2023-02-18

5. On the Second Eigenvalue of Random Bipartite Biregular Graphs;Journal of Theoretical Probability;2022-07-15