The isomorphism problem for directed path graphs and for rooted directed path graphs
Journal of Algorithms
Recognizing interval digraphs and interval bigraphs in polynomial time
Discrete Applied Mathematics
A Linear Time Algorithm for Deciding Interval Graph Isomorphism
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs
Discrete Applied Mathematics
Discrete Applied Mathematics
Interval bigraphs and circular arc graphs
Journal of Graph Theory
The np-completeness of the hamiltonian cycle problem in planar diagraphs with degree bound two
Information Processing Letters
A new approach to graph recognition and applications to distance-hereditary graphs
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Canonical data structure for interval probe graphs
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Parameterized Complexity
Interval graphs: canonical representation in logspace
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
The longest path problem is polynomial on cocomparability graphs
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Interval Graphs: Canonical Representations in Logspace
SIAM Journal on Computing
| Hi-index | 0.00 |
A graph G = (V, E) is said to be an intersection graph if and only if there is a set of objects such that each vertex v in V corresponds to an object Ov and {u, v} ∈ E if and only if Ov and Ou have a nonempty intersection. Interval graphs are typical intersection graph class, and widely investigated since they have simple structures and many hard problems become easy on the graphs. In this paper, we survey known results and investigate (unit) grid intersection graphs, which is one of natural generalized interval graphs. We show that the graph class has so rich structure that some typical problems are still hard on the graph class.