A Polynomial Time Algorithm for Finding Linear Interval Graph Patterns

DOI10.1007/978-3-540-72504-6_6zbMath1198.05147OpenAlexW1494810850MaRDI QIDQ5425421

Takayoshi Shoudai, Hitoshi Yamasaki

Publication date: 13 November 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-72504-6_6

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (4)

Exact Learning of Finite Unions of Graph Patterns from Queries ⋮ Learning block-preserving graph patterns and its application to data mining ⋮ Learning Block-Preserving Outerplanar Graph Patterns and Its Application to Data Mining ⋮ Mining of Frequent Block Preserving Outerplanar Graph Structured Patterns

This page was built for publication: A Polynomial Time Algorithm for Finding Linear Interval Graph Patterns