Algorithms 2013, 6(1), 60-83; doi:10.3390/a6010060
Article

Tractabilities and Intractabilities on Geometric Intersection Graphs

Received: 23 October 2012; in revised form: 10 January 2013 / Accepted: 14 January 2013 / Published: 25 January 2013
(This article belongs to the Special Issue Graph Algorithms)
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Abstract: A graph is said to be an intersection graph if there is a set of objects such that each vertex corresponds to an object and two vertices are adjacent if and only if the corresponding objects have a nonempty intersection. There are several natural graph classes that have geometric intersection representations. The geometric representations sometimes help to prove tractability/intractability of problems on graph classes. In this paper, we show some results proved by using geometric representations.
Keywords: bandwidth; chain graphs; graph isomorphism; Hamiltonian path problem; interval graphs; threshold graphs; unit grid intersection graphs
PDF Full-text Download PDF Full-Text [193 KB, uploaded 25 January 2013 16:03 CET]

Export to BibTeX |
EndNote


MDPI and ACS Style

Uehara, R. Tractabilities and Intractabilities on Geometric Intersection Graphs. Algorithms 2013, 6, 60-83.

AMA Style

Uehara R. Tractabilities and Intractabilities on Geometric Intersection Graphs. Algorithms. 2013; 6(1):60-83.

Chicago/Turabian Style

Uehara, Ryuhei. 2013. "Tractabilities and Intractabilities on Geometric Intersection Graphs." Algorithms 6, no. 1: 60-83.

Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert