Combinatorial Pattern Matching

DOI10.1007/B98377zbMATH Open1103.68655MaRDI QIDQ5315344FDOQ5315344

Authors: Christophe Paul, Mathieu Raffinot, M. A. Habib 

Publication date: 7 September 2005

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

Recommendations

• Fast algorithms for identifying maximal common connected sets of interval graphs
• Graph-Based Representations in Pattern Recognition
• Competitive graph searches
• Finding Maximum Common Connected Subgraphs Using Clique Detection or Constraint Satisfaction Algorithms
• scientific article; zbMATH DE number 3892606

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40)

Cited In (2)

• Competitive graph searches
• Fast algorithms for identifying maximal common connected sets of interval graphs

This page was built for publication: Combinatorial Pattern Matching

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