Skip to main navigation
Skip to search
Skip to main content
Illinois Experts Home
LOGIN & Help
Link opens in a new tab
Search content at Illinois Experts
Home
Profiles
Research units
Research & Scholarship
Datasets
Honors
Press/Media
Activities
Edge-disjoint paths in planar graphs
C. Chekuri
, S. Khanna
, F. B. Shepherd
Research output
:
Contribution to journal
›
Conference article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Edge-disjoint paths in planar graphs'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Planar Graph
100%
Congestion
100%
Edge-disjoint Paths
100%
Integrality Gap
50%
Disjoint Paths Problem
50%
Two-path
33%
Multicommodity Flow
33%
Undirected Planar Graphs
33%
All-pairs
16%
Unsplittable Flow Problem
16%
Min-cut
16%
Maximum Flow
16%
General Graphs
16%
Logarithmic Approximation
16%
Integer multicommodity Flow
16%
Graph Theoretic
16%
Multi-commodity Flow Problem
16%
Mathematics
Edge
100%
Planar Graph
100%
Path Problem
42%
Polynomial
14%
Starting Point
14%
Main Result
14%
Integer
14%
Min-Cut
14%
Graph-Like
14%
Computer Science
Planar Graph
100%
Starting Point
16%
Strongest Result
16%
Maxflow
16%
Logarithmic Approximation
16%
approximation factor
16%
Proof
16%