A Polynomial Time Algorithm for Finding Linear Interval Graph Patterns

DOI10.1007/978-3-540-72504-6_6MaRDI QIDQ5425421zbMATH OpenOpenAlexFDO

Authors Hitoshi Yamasaki, Takayoshi Shoudai

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 representations (geometric and intersection representations, etc.) (05C62) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• A linear time recognition algorithm for proper interval graphs
• scientific article; zbMATH DE number 4049085
• A linear-time algorithm for proper interval graph recognition
• An Incremental Linear-Time Algorithm for Recognizing Interval Graphs
• scientific article; zbMATH DE number 176590
• A polynomial time recognition algorithm for probe interval graphs
• Linear algorithm for domatic number problem on interval graphs
• Polynomial time pattern matching algorithm for ordered graph patterns
• Strictly interval graphs: characterization and linear time recognition
• Detecting fixed patterns in chordal graphs in polynomial time

Cited in

(5)

• Linear algorithm for domatic number problem on interval graphs
• Learning block-preserving graph patterns and its application to data mining
• Exact Learning of Finite Unions of Graph Patterns from Queries
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5425421)