@article{oai:muroran-it.repo.nii.ac.jp:00010944,
 author = {髙岡, 旭 and TAKAOKA, Asahi},
 issue = {8},
 journal = {IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences},
 month = {},
 note = {application/pdf, 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.},
 pages = {1838--1840},
 title = {Graph Isomorphism Completeness for Trapezoid Graphs},
 volume = {E98.A},
 year = {2015},
 yomi = {タカオカ, アサヒ}
}