JAIST Repository >
School of Information Science >
Articles >
Journal Articles >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10119/11436

Title: Tractabilities and Intractabilities on Geometric Intersection Graphs
Authors: Uehara, Ryuhei
Keywords: bandwidth
chain graph
graph isomorphism
Hamiltonian path problem
interval/threshold/unit grid intersection graphs
Issue Date: 2013-01-25
Publisher: MDPI Publishing
Magazine name: Algorithms
Volume: 6
Number: 1
Start page: 60
End page: 83
DOI: 10.3390/a6010060
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.
Rights: © 2013 by the authors; licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution license (http://creativecommons.org/licenses/by/3.0/).
URI: http://hdl.handle.net/10119/11436
Material Type: publisher
Appears in Collections:b10-1. 雑誌掲載論文 (Journal Articles)

Files in This Item:

File Description SizeFormat
19112.pdf181KbAdobe PDFView/Open

All items in DSpace are protected by copyright, with all rights reserved.

 


Contact : Library Information Section, JAIST (ir-sys[at]ml.jaist.ac.jp)