Open AccessThis article is
- freely available
Tractabilities and Intractabilities on Geometric Intersection Graphs†
School of Information Science, Japan Advanced Institute of Science and Technology, Asahidai 1-1, Nomi, Ishikawa 923-1292, Japan
† Parts of Results were Presented at ISAAC 2008 and WALCOM 2008.
Received: 23 October 2012; in revised form: 10 January 2013 / Accepted: 14 January 2013 / Published: 25 January 2013
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
Citations to this Article
Cite This Article
MDPI and ACS Style
Uehara, R. Tractabilities and Intractabilities on Geometric Intersection Graphs. Algorithms 2013, 6, 60-83.
Uehara R. Tractabilities and Intractabilities on Geometric Intersection Graphs. Algorithms. 2013; 6(1):60-83.
Uehara, Ryuhei. 2013. "Tractabilities and Intractabilities on Geometric Intersection Graphs." Algorithms 6, no. 1: 60-83.