Abstract
A graph is an interval graph if and only if each vertex in the graph can be associated with an interval on the real line such that any two vertices are adjacent in the graph exactly when the corresponding intervals have a nonempty intersection. A number of interesting applications for interval graphs have been found in the literature. In order to find structural features common to structural data which can be represented by intervals, this paper proposes new interval graph structured patterns, called linear interval graph patterns, and a polynomial time algorithm for finding a minimally generalized linear interval graph pattern explaining a given finite set of interval graphs. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Yamasaki, H., & Shoudai, T. (2007). A polynomial time algorithm for finding linear interval graph patterns. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4484 LNCS, pp. 67–78). Springer Verlag. https://doi.org/10.1007/978-3-540-72504-6_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
