Recognizing some subclasses of vertex intersection graphs of 0-bend paths in a grid

Authors:
Steven Chaplick;Elad Cohen;Juraj Stacho
Affiliations:
Department of Computer Science, University of Toronto, Toronto, Ontario, Canada;Caesarea Rothschild Institute, University of Haifa, Mt. Carmel, Haifa, Israel;Caesarea Rothschild Institute, University of Haifa, Mt. Carmel, Haifa, Israel
Venue:
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
Year:
2011

Citing 7
Cited 1

Stretching a Knock-Knee Layout for Multilayer Wiring

IEEE Transactions on Computers
String graphs. II.: Recognizing string graphs is NP-hard

Journal of Combinatorial Theory Series B
A survey on wiring

Journal of Information Processing and Cybernetics
Intersection graphs of segments

Journal of Combinatorial Theory Series B
Optimal Embedding of Complete Binary Trees into Lines and Grids

WG '91 Proceedings of the 17th International Workshop
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms

Journal of Computer and System Sciences

Bend-bounded path intersection graphs: sausages, noodles, and waffles on a grill

WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate graphs that can be represented as vertex intersections of horizontal and vertical paths in a grid, known as B0 -VPG graphs. Recognizing these graphs is an NP-hard problem. In light of this, we focus on their subclasses. In the paper, we describe polynomial time algorithms for recognizing chordal B0 -VPG graphs, and for recognizing B0 -VPG graphs that have a representation on a grid with 2 rows.