Graph Isomorphism Completeness for Trapezoid Graphs
Copyright policy )Graph Isomorphism Completeness for Trapezoid Graphs
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.
4 pages, 3 Postscript figures
FOS: Computer and information sciences, Computer Science - Computational Complexity, Discrete Mathematics (cs.DM), Computational Complexity (cs.CC), 004, 510, Computer Science - Discrete Mathematics
FOS: Computer and information sciences, Computer Science - Computational Complexity, Discrete Mathematics (cs.DM), Computational Complexity (cs.CC), 004, 510, Computer Science - Discrete Mathematics
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).5 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!