Testing isomorphism of outerplanar graphs in parallel

2005 ◽  
pp. 220-230 ◽  
Author(s):  
Bogdan S. Chlebus ◽  
Krzysztof Diks ◽  
Tomasz Radzik
Keyword(s):  
Outerplanar Graphs

scholarly journals Metric Dimension Parameterized By Treewidth

Algorithmica ◽  
2021 ◽  
Author(s):  
Édouard Bonnet ◽  
Nidhi Purohit
Keyword(s):  
Computable Function ◽  
Polynomial Time Algorithm ◽  
Time Algorithm ◽  
Minimum Size ◽  
Metric Dimension ◽  
Resolving Set ◽  
Input Graph ◽  
Outerplanar Graphs ◽  
Bounded Treewidth ◽  
Fpt Algorithm

AbstractA resolving set S of a graph G is a subset of its vertices such that no two vertices of G have the same distance vector to S. The Metric Dimension problem asks for a resolving set of minimum size, and in its decision form, a resolving set of size at most some specified integer. This problem is NP-complete, and remains so in very restricted classes of graphs. It is also W[2]-complete with respect to the size of the solution. Metric Dimension has proven elusive on graphs of bounded treewidth. On the algorithmic side, a polynomial time algorithm is known for trees, and even for outerplanar graphs, but the general case of treewidth at most two is open. On the complexity side, no parameterized hardness is known. This has led several papers on the topic to ask for the parameterized complexity of Metric Dimension with respect to treewidth. We provide a first answer to the question. We show that Metric Dimension parameterized by the treewidth of the input graph is W[1]-hard. More refinedly we prove that, unless the Exponential Time Hypothesis fails, there is no algorithm solving Metric Dimension in time $$f(\text {pw})n^{o(\text {pw})}$$ f ( pw ) n o ( pw ) on n-vertex graphs of constant degree, with $$\text {pw}$$ pw the pathwidth of the input graph, and f any computable function. This is in stark contrast with an FPT algorithm of Belmonte et al. (SIAM J Discrete Math 31(2):1217–1243, 2017) with respect to the combined parameter $$\text {tl}+\Delta$$ tl + Δ , where $$\text {tl}$$ tl is the tree-length and $$\Delta$$ Δ the maximum-degree of the input graph.

scholarly journals Minimum rank of outerplanar graphs

2012 ◽  
Vol 436 (9) ◽  
pp. 3701-3720
Author(s):  
John Sinkovic ◽  
Mark Kempton
Keyword(s):  
Minimum Rank ◽  
Outerplanar Graphs

scholarly journals Relaxed game chromatic number of trees and outerplanar graphs

2004 ◽  
Vol 281 (1-3) ◽  
pp. 209-219 ◽  
Author(s):  
Wenjie He ◽  
Jiaojiao Wu ◽  
Xuding Zhu
Keyword(s):  
Chromatic Number ◽  
Outerplanar Graphs ◽  
Game Chromatic Number

Straight-Line Grid Drawings of Label-Constrained Outerplanar Graphs with O(n logn) Area (Extended Abstract)

2009 ◽  
pp. 310-321
Author(s):  
Md. Rezaul Karim ◽  
Md. Jawaherul Alam ◽  
Md. Saidur Rahman
Keyword(s):  
Outerplanar Graphs ◽  
Straight Line

scholarly journals The subgraph isomorphism problem for outerplanar graphs

1982 ◽  
Vol 17 (1) ◽  
pp. 91-97 ◽  
Author(s):  
Maciej M. SysŁ;o
Keyword(s):  
Isomorphism Problem ◽  
Subgraph Isomorphism ◽  
Outerplanar Graphs

Embedding Outerplanar Graphs in Small Books

1987 ◽  
Vol 8 (2) ◽  
pp. 198-218 ◽  
Author(s):  
Lenwood S. Heath
Keyword(s):  
Outerplanar Graphs

scholarly journals The polynomial method for list-colouring extendability of outerplanar graphs

2021 ◽  
Author(s):  
Przemysław Gordinowicz ◽  
Paweł Twardowski
Keyword(s):  
Polynomial Method ◽  
Outerplanar Graphs

scholarly journals p-box: a new graph model

2015 ◽  
Vol Vol. 17 no. 1 (Graph Theory) ◽  
Author(s):  
Mauricio Soto ◽  
Christopher Thraves-Caro
Keyword(s):  
Graph Theory ◽  
Graph Model ◽  
Directed Path ◽  
Outerplanar Graphs ◽  
New Model ◽  
Model Based ◽  
Representative Element ◽  
International Audience ◽  
Graph Families

Graph Theory International audience In this document, we study the scope of the following graph model: each vertex is assigned to a box in ℝd and to a representative element that belongs to that box. Two vertices are connected by an edge if and only if its respective boxes contain the opposite representative element. We focus our study on the case where boxes (and therefore representative elements) associated to vertices are spread in ℝ. We give both, a combinatorial and an intersection characterization of the model. Based on these characterizations, we determine graph families that contain the model (e. g., boxicity 2 graphs) and others that the new model contains (e. g., rooted directed path). We also study the particular case where each representative element is the center of its respective box. In this particular case, we provide constructive representations for interval, block and outerplanar graphs. Finally, we show that the general and the particular model are not equivalent by constructing a graph family that separates the two cases.

scholarly journals A Universal Point Set for 2-Outerplanar Graphs

2015 ◽  
pp. 409-422 ◽  
Author(s):  
Patrizio Angelini ◽  
Till Bruckdorfer ◽  
Michael Kaufmann ◽  
Tamara Mchedlidze
Keyword(s):  
Outerplanar Graphs ◽  
Point Set

scholarly journals An efficientg-centroid location algorithm for cographs

2005 ◽  
Vol 2005 (9) ◽  
pp. 1405-1413 ◽  
Author(s):  
V. Prakash
Keyword(s):  
Location Problem ◽  
Maximum Clique ◽  
Polynomial Time Algorithm ◽  
Time Algorithm ◽  
Outerplanar Graphs ◽  
Arbitrary Graph ◽  
Maximal Outerplanar Graphs ◽  
Split Graphs ◽  
Location Algorithm ◽  
Centroid Location

In 1998, Pandu Rangan et al. Proved that locating theg-centroid for an arbitrary graph is𝒩𝒫-hard by reducing the problem of finding the maximum clique size of a graph to theg-centroid location problem. They have also given an efficient polynomial time algorithm for locating theg-centroid for maximal outerplanar graphs, Ptolemaic graphs, and split graphs. In this paper, we present anO(nm)time algorithm for locating theg-centroid for cographs, wherenis the number of vertices andmis the number of edges of the graph.

Sign in / Sign up

Export Citation Format

Share Document