Disjoint paths in densely embedded graphs
- 19 November 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- On-line admission control and circuit routing for high performance computing and communicationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Optimal Construction of Edge-Disjoint Paths in Random GraphsSIAM Journal on Computing, 1998
- Approximations for the disjoint paths problem in high-diameter planar networksPublished by Association for Computing Machinery (ACM) ,1995
- Existence and Construction of Edge-Disjoint Paths on Expander GraphsSIAM Journal on Computing, 1994
- On-line load balancing with applications to machine scheduling and virtual circuit routingPublished by Association for Computing Machinery (ACM) ,1993
- A Simple Parallel Algorithm for the Maximal Independent Set ProblemSIAM Journal on Computing, 1986
- Edge-disjoint paths in planar graphsJournal of Combinatorial Theory, Series B, 1985
- Multicommodity flows in planar graphsJournal of Combinatorial Theory, Series B, 1981
- A Separator Theorem for Planar GraphsSIAM Journal on Applied Mathematics, 1979
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972