Results 11  20
of
323
On Infinite Generalized Outerplanar Graphs
"... Sedl'acek in [6] defined the generalized outerplanar graphs like the finite graphs which can be embedded in the plane in such a way that at least one endvertex of each edge lies on the boundary of the same face, and he gave a characterization of them by forbidden subgraphs. In this paper, we s ..."
Abstract
 Add to MetaCart
Sedl'acek in [6] defined the generalized outerplanar graphs like the finite graphs which can be embedded in the plane in such a way that at least one endvertex of each edge lies on the boundary of the same face, and he gave a characterization of them by forbidden subgraphs. In this paper, we
Drawing outerplanar graphs
, 2013
"... It is shown that for any outerplanar graph G there is a one to one mapping of the vertices of G to the plane, so that the number of distinct distances between pairs of connected vertices is at most three. This settles a problem of Carmi, Dujmovic, Morin and Wood. The proof combines (elementary) geom ..."
Abstract
 Add to MetaCart
It is shown that for any outerplanar graph G there is a one to one mapping of the vertices of G to the plane, so that the number of distinct distances between pairs of connected vertices is at most three. This settles a problem of Carmi, Dujmovic, Morin and Wood. The proof combines (elementary
Outerplanar graphs and Delaunay triangulations
, 2011
"... Over 20 years ago, Dillencourt [1] showed that all outerplanar graphs can be realized as Delaunay triangulations of points in convex position. His proof is elementary, constructive and leads to a simple algorithm for obtaining a concrete Delaunay realization. In this note, we provide two new, altern ..."
Abstract
 Add to MetaCart
Over 20 years ago, Dillencourt [1] showed that all outerplanar graphs can be realized as Delaunay triangulations of points in convex position. His proof is elementary, constructive and leads to a simple algorithm for obtaining a concrete Delaunay realization. In this note, we provide two new
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 14 (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
Generating outerplanar graphs uniformly at random
 IN COMBINATORICS, PROBABILITY, AND COMPUTATION
, 2003
"... 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 structure, and compute the exact number of ..."
Abstract

Cited by 9 (6 self)
 Add to MetaCart
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 structure, and compute the exact number
ABSTRACT FOG: Finding Outerplanar Graphs
"... In this demo we will present FOG, a system that mines frequent outerplanar graphs. We argue that outerplanar graphs are an interesting class as they can be mined efficiently and are practically relevant for chemical applications. Our system provides several features that allow a user to ask detailed ..."
Abstract
 Add to MetaCart
In this demo we will present FOG, a system that mines frequent outerplanar graphs. We argue that outerplanar graphs are an interesting class as they can be mined efficiently and are practically relevant for chemical applications. Our system provides several features that allow a user to ask
Genus distributions of cubic outerplanar graphs
, 2011
"... We present a quadratictime algorithm for computing the genus distribution of any 3regular outerplanar graph. Although recursions and some formulas for genus distributions have previously been calculated for bouquets and for various kinds of ladders and other special families of graphs, cubic outer ..."
Abstract

Cited by 15 (15 self)
 Add to MetaCart
We present a quadratictime algorithm for computing the genus distribution of any 3regular outerplanar graph. Although recursions and some formulas for genus distributions have previously been calculated for bouquets and for various kinds of ladders and other special families of graphs, cubic
Minimal Cycle Bases of Outerplanar Graphs
, 1998
"... 2connected outerplanar graphs have a unique minimal cycle basis with length 2E  V. They are the only Hamiltonian graphs with a cycle basis of this length. ..."
Abstract

Cited by 16 (0 self)
 Add to MetaCart
2connected outerplanar graphs have a unique minimal cycle basis with length 2E  V. They are the only Hamiltonian graphs with a cycle basis of this length.
Frequent Subgraph Mining in Outerplanar Graphs
 PROC. 12TH ACM SIGKDD INT. CONF. ON KNOWLEDGE DISCOVERY AND DATA MINING
, 2006
"... In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining problem for tree datasets can be solved in incremental polynomial time, it becomes intractable for arbitrary graph databases ..."
Abstract

Cited by 39 (7 self)
 Add to MetaCart
databases. Existing approaches have therefore resorted to various heuristic strategies and restrictions of the search space, but have not identified a practically relevant tractable graph class beyond trees. In this paper, we consider the class of outerplanar graphs, a strict generalization of trees
Results 11  20
of
323