Results 1  10
of
178
I/OOptimal Algorithms for Outerplanar Graphs
, 2001
"... We present linearI/O algorithms for fundamental graph problems on embedded outerplanar graphs. We show that breadthfirst search, depthfirst search, singlesource shortest paths, triangulation, and computing an ɛseparator of size O(1/ɛ) takeO(scan(N)) I/Os on embedded outerplanar graphs. We also s ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
show that it takes O(sort(N)) I/Os to test whether a given graph is outerplanar and to compute an outerplanar embedding of an outerplanar graph, thereby providing O(sort(N))I/O algorithms for the above problems if no embedding of the graph is given. As all these problems have lineartime algorithms
Generating Outerplanar Graphs
"... supported by the DFG (GRK 588/1) Abstract. We show how to generate labeled and unlabeled outerplanar graphs with n vertices uniformly at random in polynomial time in n. To generate labeled outerplanar graphs, we present a counting technique using the decomposition of a graph according to its block s ..."
Abstract
 Add to MetaCart
Las Vegas algorithm to generate unlabeled outerplanar graphs uniformly at random in expected polynomial time. random structures, outerplanar graphs, efficient counting, uniform generation 1 Introduction There are several fields of applications of efficient algorithms that generate ran
External memory algorithms for outerplanar graphs
 In Proceedings of the 10th International Symposium on Algorithms and Computation
, 1999
"... Abstract. We present external memory algorithms for outerplanarity testing, embedding outerplanar graphs, breadthfirst search (BFS) and depthfirst search (DFS) in outerplanar graphs, and finding a 2 ..."
Abstract

Cited by 18 (5 self)
 Add to MetaCart
Abstract. We present external memory algorithms for outerplanarity testing, embedding outerplanar graphs, breadthfirst search (BFS) and depthfirst search (DFS) in outerplanar graphs, and finding a 2
Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding and Generation
, 2003
"... In this article we define a canonical decomposition of rooted outerplanar maps into a spanning tree and a list of edges. This decomposition, constructible in linear time, implies the existence of bijection between rooted outerplanar maps with n nodes and bicolored rooted ordered trees with n node ..."
Abstract

Cited by 15 (1 self)
 Add to MetaCart
In this article we define a canonical decomposition of rooted outerplanar maps into a spanning tree and a list of edges. This decomposition, constructible in linear time, implies the existence of bijection between rooted outerplanar maps with n nodes and bicolored rooted ordered trees with n
Generating Random Outerplanar Graphs
 In 1 st Workshop on Algorithms for Listing, Counting, and Enumeration
, 2003
"... We show how to generate labeled and unlabeled outerplanar graphs with n vertices uniformly at random in (expected) polynomial time in n. To generate these graphs, we present a new counting technique using the decomposition of a graph according to its block structure and compute the exact number ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
We show how to generate labeled and unlabeled outerplanar graphs with n vertices uniformly at random in (expected) polynomial time in n. To generate these graphs, we present a new counting technique using the decomposition of a graph according to its block structure and compute the exact number
Approximating the Pathwidth of Outerplanar Graphs
 INFORM. PROCESS. LETT
, 1998
"... Pathwidth is a wellknown NPComplete graph metric. Only very simple classes of graphs, such as trees, are known to permit practical pathwidth algorithms. We present a technique to approximate the pathwidth of outerplanar graphs. Our algorithm works in linear time, is genuinely practical and produce ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
Pathwidth is a wellknown NPComplete graph metric. Only very simple classes of graphs, such as trees, are known to permit practical pathwidth algorithms. We present a technique to approximate the pathwidth of outerplanar graphs. Our algorithm works in linear time, is genuinely practical
Generating outerplanar graphs uniformly at random
 in Combinatorics, Probability, and Computation
, 2003
"... supported by the DFG (GRK 588/1) Abstract. We show how to generate labeled and unlabeled outerplanar graphs with n vertices uniformly at random in polynomial time in n. To generate labeled outerplanar graphs, we present a counting technique using the decomposition of a graph according to its block s ..."
Abstract

Cited by 9 (6 self)
 Add to MetaCart
supported by the DFG (GRK 588/1) Abstract. We show how to generate labeled and unlabeled outerplanar graphs with n vertices uniformly at random in polynomial time in n. To generate labeled outerplanar graphs, we present a counting technique using the decomposition of a graph according to its block
Constant Time Generation of Rooted and Colored Outerplanar Graphs
, 2010
"... An outerplanar graph is a graph that admits a planar embedding such that all vertices appear on the boundary of its outer face. Given a positive integer nand a color set C with K> 0 colors, we consider the problem of enumerating all colored and rooted outerplanar graphs with at most n vertices wi ..."
Abstract
 Add to MetaCart
An outerplanar graph is a graph that admits a planar embedding such that all vertices appear on the boundary of its outer face. Given a positive integer nand a color set C with K> 0 colors, we consider the problem of enumerating all colored and rooted outerplanar graphs with at most n vertices
HammockonEars Decomposition: A Technique for the Efficient Parallel Solution of Shortest Paths and Other Problems
 Theoretical Computer Science
, 1996
"... We show how to decompose efficiently in parallel any graph into a number, ~ fl, of outerplanar subgraphs (called hammocks) satisfying certain separator properties. Our work combines and extends the sequential hammock decomposition technique introduced by G. Frederickson and the parallel ear decom ..."
Abstract

Cited by 9 (6 self)
 Add to MetaCart
We show how to decompose efficiently in parallel any graph into a number, ~ fl, of outerplanar subgraphs (called hammocks) satisfying certain separator properties. Our work combines and extends the sequential hammock decomposition technique introduced by G. Frederickson and the parallel ear
Limits to Parallel Computation: PCompleteness Theory
, 1995
"... D. Kavadias, L. M. Kirousis, and P. G. Spirakis. The complexity of the reliable connectivity problem. Information Processing Letters, 39(5):245252, 13 September 1991. (135) [206] P. Kelsen. On computing a maximal independent set in a hypergraph of constant dimension in parallel. In Proceedings of ..."
Abstract

Cited by 167 (5 self)
 Add to MetaCart
194. (150, 151, 153) [208] S. Khuller. On computing graph closures. Information Processing Letters, 31(5):249255, 12 June 1989. (142, 224) [209] S. Khuller and B. Schieber. E#cient parallel algorithms for testing k connectivity and finding disjoint st paths in graphs. SIAM Journal on Computing, 20
Results 1  10
of
178