Sciweavers

TPHOL
2002
IEEE
13 years 8 months ago
The 5 Colour Theorem in Isabelle/Isar
Based on an inductive definition of triangulations, a theory of undirected planar graphs is developed in Isabelle/HOL. The proof of the 5 colour theorem is discussed in some detai...
Gertrud Bauer, Tobias Nipkow
ESA
2007
Springer
188views Algorithms» more  ESA 2007»
13 years 9 months ago
Fast and Compact Oracles for Approximate Distances in Planar Graphs
We present an experimental evaluation of an approximate distance oracle recently suggested by Thorup [1] for undirected planar graphs. The oracle uses the existence of graph separa...
Laurent Flindt Muller, Martin Zachariasen
STOC
2006
ACM
174views Algorithms» more  STOC 2006»
14 years 3 months ago
Edge-disjoint paths in Planar graphs with constant congestion
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...
Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd