2 search results - page 1 / 1 » Embeddings of k-Connected Graphs of Pathwidth k |
100
Voted
SWAT
2000
Springer
15 years 6 months ago
2000
Springer
131
Voted
STOC
2009
ACM
16 years 3 months ago
2009
ACM
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...