Results 1  10
of
323
Dominating Sets for Outerplanar Graphs
"... Abstract: We provide lower and upper bounds for the domination numbers and the connected domination numbers for outerplanar graphs. We also provide a recursive algorithm that finds a connected domination set for an outerplanar graph. Finally, we show that for outerplanar graphs where all bounded fa ..."
Abstract
 Add to MetaCart
Abstract: We provide lower and upper bounds for the domination numbers and the connected domination numbers for outerplanar graphs. We also provide a recursive algorithm that finds a connected domination set for an outerplanar graph. Finally, we show that for outerplanar graphs where all bounded
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 6 (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
Enumeration of Unlabeled Outerplanar Graphs
"... We determine the exact and asymptotic number of unlabeled outerplanar graphs. The exact number gn of unlabeled outerplanar graphs on n vertices can be computed in polynomial time, and gn is asymptotically g n −5/2 ρ −n, where g≈0.00909941 and ρ −1 ≈ 7.50360 can be approximated. Using our enumerative ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
We determine the exact and asymptotic number of unlabeled outerplanar graphs. The exact number gn of unlabeled outerplanar graphs on n vertices can be computed in polynomial time, and gn is asymptotically g n −5/2 ρ −n, where g≈0.00909941 and ρ −1 ≈ 7.50360 can be approximated. Using our
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
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
On colorings of squares of outerplanar graphs
 Proceedings of the Fifteenth Annual ACMSIAM Symposium on Discrete Algorithms
, 2004
"... We study vertex colorings of the square G 2 of an outerplanar graph G. We find the optimal bound of the inductiveness, chromatic number and the clique number of G 2 as a function of the maximum degree ∆ of G for all ∆ ∈ N. As a bonus, we obtain the optimal bound of the choosability (or the listchr ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
We study vertex colorings of the square G 2 of an outerplanar graph G. We find the optimal bound of the inductiveness, chromatic number and the clique number of G 2 as a function of the maximum degree ∆ of G for all ∆ ∈ N. As a bonus, we obtain the optimal bound of the choosability (or the list
On the orthogonal drawing of outerplanar graphs
 in Proceedings of COCOON ’04, Lect. Notes Comput. Sci. 3106
, 2004
"... Abstract. In this paper we show that an outerplanar graph G with maximum degree at most 3 has a 2D orthogonal drawing with no bends if and only if G contains no triangles. We also show that an outerplanar graph G with maximum degree at most 6 has a 3D orthogonal drawing with no bends if and only i ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Abstract. In this paper we show that an outerplanar graph G with maximum degree at most 3 has a 2D orthogonal drawing with no bends if and only if G contains no triangles. We also show that an outerplanar graph G with maximum degree at most 6 has a 3D orthogonal drawing with no bends if and only
Pathwidth of Outerplanar Graphs
 Journal of Graph Theory
, 2007
"... We are interested in the relation between the pathwidth of a biconnected outerplanar graph and the pathwidth of its (geometric) dual. Bodlaender and Fomin [3], after having proved that the pathwidth of every biconnected outerplanar graph is always at most twice the pathwidth of its (geometric) dual ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
We are interested in the relation between the pathwidth of a biconnected outerplanar graph and the pathwidth of its (geometric) dual. Bodlaender and Fomin [3], after having proved that the pathwidth of every biconnected outerplanar graph is always at most twice the pathwidth of its (geometric) dual
Proximity Drawings of Outerplanar Graphs
, 1996
"... A proximity drawing of a graph is one in which pairs of adjacent vertices are drawn relatively close together according to some proximity measure while pairs of nonadjacent vertices are drawn relatively far apart. The fundamental question concerning proximity drawability is: Given a graph G and a d ..."
Abstract

Cited by 13 (6 self)
 Add to MetaCart
definition of proximity, is it possible to construct a proximity drawing of G? We consider this question for outerplanar graphs with respect to an infinite family of proximity drawings called fidrawings. These drawings include as special cases the wellknown Gabriel drawings (when fi = 1), and relative
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 11 (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
An algorithm for outerplanar graphs with parameter
 IOWA STATE UNIVERSITY OF SCIENCE AND TECHNOLOGY SCIENCE with PRACTICE DEPARTMENT OF COMPUTER SCIENCE Tech Report: TR 9208 Submission Date: April 22
, 1991
"... For nvertex outerplanar graphs, it is proven that O(n 2.87) is an upper bound on the number of breakpoints of the function which gives the maximum weight of an independent set, where the vertex weights vary as linear functions of a parameter. An O(n 2.87) algorithm for finding the solution is propo ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
For nvertex outerplanar graphs, it is proven that O(n 2.87) is an upper bound on the number of breakpoints of the function which gives the maximum weight of an independent set, where the vertex weights vary as linear functions of a parameter. An O(n 2.87) algorithm for finding the solution
Results 1  10
of
323