APPROX
2008
Springer
14 years 1 months ago
2008
Springer
In order to perform an average-case analysis for specific input distributions one needs to derive and understand properties of a 'typical' input instance. In the case of...
FSTTCS
2000
Springer
14 years 3 months ago
2000
Springer
We present a new scheme for storing a planar graph in external memory so that any online path can be traversed in an I-O efficient way. Our storage scheme significantly improves th...
ESA
2000
Springer
14 years 3 months ago
2000
Springer
Abstract. The depth of a planar embedding is a measure of the topological nesting of the biconnected components of the graph. Minimizing the depth of planar embeddings has importan...
FOCS
2004
IEEE
14 years 3 months ago
2004
IEEE
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs (demands) s1t1, s2t2, . . ., sktk, the goal is to maximize the number ...
COCO
2006
Springer
14 years 3 months ago
2006
Springer
We study the complexity of restricted versions of s-t-connectivity, which is the standard complete problem for NL. In particular, we focus on different classes of planar graphs, o...
STOC
1990
ACM
14 years 3 months ago
1990
ACM
a 3-dimensions a separator size where is the ber of 3-simplexes in and is the number of ization of the separator results for planar graphs, such as the and Tarjan planar separator...
STOC
1990
ACM
14 years 3 months ago
1990
ACM
ions (Extended Abstract) Noga Alon Paul Seymour Robin Thomas Let G be an n-vertex graph with nonnegative weights whose sum is 1 assigned to its vertices, and with no minor isomorp...
GD
1997
Springer
14 years 3 months ago
1997
Springer
d Abstract) In this paper, we investigate area requirements for drawing s-t hierarchically planar graphs by straight-lines. Two drawing standards will be discussed: 1) each vertex ...
MFCS
1998
Springer
14 years 3 months ago
1998
Springer
It is known that a language is context-free iff it is the set of borders of the trees of recognizable set, where the border of a (labelled) tree is the word consisting of its leaf ...
GD
1999
Springer
14 years 3 months ago
1999
Springer
In this paper we present a novel approach for cluster-based drawing of large planar graphs that maintains planarity. Our technique works for arbitrary planar graphs and produces a ...