|
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/4896
|
| Title: | Graph Isomorphism Completeness for Chordal Bipartite Graphs and Strongly Chordal Graphs |
| Authors: | Uehara, Ryuhei
Toda, Seinosuke
Nagoya, Takayuki |
| Keywords: | Graph isomorphism problem
Graph isomorphism complete
Strongly chordal graphs
Chordal bipertite graphs |
| Issue Date: | 2005-01-30 |
| Publisher: | Elsevier |
| Magazine name: | Discrete Applied Mathematics |
| Volume: | 145 |
| Number: | 3 |
| Start page: | 479 |
| End page: | 482 |
| DOI: | 10.1016/j.dam.2004.06.008 |
| Abstract: | This paper deal with the graph isomorphism (GI) problem for two graph classes: chordal bipartite graphs and strongly chrdal graphs. It is known that GI problem is GI complete for some special graph classes including regular graphs, bipartite graphs, chordal graphs, comparability graphs, split graphs, and k-trees for unbounded k. On the other side, the relative complexity of the GI problem for the above classes was unknown. We prove that deciding isomorphism of the classes are GI complete. |
| Rights: | NOTICE: This is the author’s version of a work accepted for publication by Elsevier.
Changes resulting from the publishing process, including peer review, editing, corrections,
structural formatting and other quality control mechanisms, may not be reflected in this
document. Changes may have been made to this work since it was submitted for publication.
A definitive version was subsequently published in Ryuhei Uehara, Seinosuke Toda and Takayuki Nagoya, Discrete Applied Mathematics, 145(3), 2005, 479-482, http://dx.doi.org/10.1016/j.dam.2004.06.008 |
| URI: | http://hdl.handle.net/10119/4896 |
| Material Type: | author |
| Appears in Collections: | b10-1. 雑誌掲載論文 (Journal Articles)
|
Files in This Item:
| File |
Description |
Size | Format |
|---|
| C3941.pdf | | 82Kb | Adobe PDF | View/Open |
|
All items in DSpace are protected by copyright, with all rights reserved.
|
