IEICE TRANSACTIONS on Fundamentals
Graph Isomorphism Completeness for Trapezoid Graphs
Summary :
The complexity of the graph isomorphism problem for trapezoid graphs has been open over a decade. This paper shows that the problem is GI-complete. More precisely, we show that the graph isomorphism problem is GI-complete for comparability graphs of partially ordered sets with interval dimension 2 and height 3. In contrast, the problem is known to be solvable in polynomial time for comparability graphs of partially ordered sets with interval dimension at most 2 and height at most 2.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E98-A No.8 pp.1838-1840
- Publication Date
- 2015/08/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E98.A.1838
- Type of Manuscript
- LETTER
- Category
- Graphs and Networks
Authors
Asahi TAKAOKA
Tokyo Institute of Technology
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Asahi TAKAOKA, "Graph Isomorphism Completeness for Trapezoid Graphs" in IEICE TRANSACTIONS on Fundamentals,
vol. E98-A, no. 8, pp. 1838-1840, August 2015, doi: 10.1587/transfun.E98.A.1838.
Abstract: The complexity of the graph isomorphism problem for trapezoid graphs has been open over a decade. This paper shows that the problem is GI-complete. More precisely, we show that the graph isomorphism problem is GI-complete for comparability graphs of partially ordered sets with interval dimension 2 and height 3. In contrast, the problem is known to be solvable in polynomial time for comparability graphs of partially ordered sets with interval dimension at most 2 and height at most 2.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E98.A.1838/_p
Copy
@ARTICLE{e98-a_8_1838,
author={Asahi TAKAOKA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Graph Isomorphism Completeness for Trapezoid Graphs},
year={2015},
volume={E98-A},
number={8},
pages={1838-1840},
abstract={The complexity of the graph isomorphism problem for trapezoid graphs has been open over a decade. This paper shows that the problem is GI-complete. More precisely, we show that the graph isomorphism problem is GI-complete for comparability graphs of partially ordered sets with interval dimension 2 and height 3. In contrast, the problem is known to be solvable in polynomial time for comparability graphs of partially ordered sets with interval dimension at most 2 and height at most 2.},
keywords={},
doi={10.1587/transfun.E98.A.1838},
ISSN={1745-1337},
month={August},}
Copy
TY - JOUR
TI - Graph Isomorphism Completeness for Trapezoid Graphs
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1838
EP - 1840
AU - Asahi TAKAOKA
PY - 2015
DO - 10.1587/transfun.E98.A.1838
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E98-A
IS - 8
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - August 2015
AB - The complexity of the graph isomorphism problem for trapezoid graphs has been open over a decade. This paper shows that the problem is GI-complete. More precisely, we show that the graph isomorphism problem is GI-complete for comparability graphs of partially ordered sets with interval dimension 2 and height 3. In contrast, the problem is known to be solvable in polynomial time for comparability graphs of partially ordered sets with interval dimension at most 2 and height at most 2.
ER -
English
