Results 1 to 10 of about 3,819 (68)
A Universal Point Set for 2-Outerplanar Graphs
, 2015 A point set $S \subseteq \mathbb{R}^2$ is universal for a class $\cal G$ if every graph of ${\cal G}$ has a planar straight-line embedding on $S$. It is well-known that the integer grid is a quadratic-size universal point set for planar graphs, while the
Patrizio Angelini +3 more
openalex +4 more sources
Clique-Relaxed Graph Coloring [PDF]
, 2011 We define a generalization of the chromatic number of a graph G called the k-clique-relaxed chromatic number, denoted χ(k)(G). We prove bounds on χ(k)(G) for all graphs G, including corollaries for outerplanar and planar graphs.
Dunn, Charles +5 more
core +2 more sources
Space-Efficient Biconnected Components and Recognition of Outerplanar Graphs [PDF]
, 2016 We present space-efficient algorithms for computing cut vertices in a given graph with $n$ vertices and $m$ edges in linear time using $O(n+\min\{m,n\log \log n\})$ bits.
Kammer, Frank +2 more
core +2 more sources
Definability Equals Recognizability for $k$-Outerplanar Graphs [PDF]
, 2015 One of the most famous algorithmic meta-theorems states that every graph property that can be defined by a sentence in counting monadic second order logic (CMSOL) can be checked in linear time for graphs of bounded treewidth, which is known as Courcelle ...
Bodlaender, Hans L., Jaffke, Lars
core +5 more sources
Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs [PDF]
, 2008 We present a deterministic way of assigning small (log bit) weights to the edges of a bipartite planar graph so that the minimum weight perfect matching becomes unique. The isolation lemma as described in (Mulmuley et al.
Datta, Samir +2 more
core +7 more sources
Shortest Reconfiguration of Perfect Matchings via Alternating Cycles [PDF]
, 2019 Motivated by adjacency in perfect matching polytopes, we study the shortest reconfiguration problem of perfect matchings via alternating cycles. Namely, we want to find a shortest sequence of perfect matchings which transforms one given perfect matching ...
Ito, Takehiro +4 more
core +2 more sources
Outerplanar graph drawings with few slopes
, 2014 We consider straight-line outerplanar drawings of outerplanar graphs in which a small number of distinct edge slopes are used, that is, the segments representing edges are parallel to a small number of directions.
Bartosz Walczak +16 more
core +2 more sources
A Polynomial-time Algorithm for Outerplanar Diameter Improvement
, 2014 The Outerplanar Diameter Improvement problem asks, given a graph $G$ and an integer $D$, whether it is possible to add edges to $G$ in a way that the resulting graph is outerplanar and has diameter at most $D$.
Cohen, Nathann +6 more
core +3 more sources
Labeling Schemes for Bounded Degree Graphs [PDF]
, 2014 We investigate adjacency labeling schemes for graphs of bounded degree $\Delta = O(1)$. In particular, we present an optimal (up to an additive constant) $\log n + O(1)$ adjacency labeling scheme for bounded degree trees.
A. Korman +11 more
core +1 more source
Frequent Subgraph Mining in Outerplanar Graphs [PDF]
, 2010 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 ...
Horvath, Tamas +2 more
core +1 more source