An algorithm for maximum common subgraph of planar triangulation graphs

DOI10.1007/978-3-642-38221-5_17MaRDI QIDQ4922160zbMATH OpenOpenAlexFDO

Authors Yao Lu, Cheng-Lin Liu, Horst Bunke

Publication date 28 May 2013

Published in Graph-Based Representations in Pattern Recognition (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-38221-5_17

zbMATH Keywords

Delauney triangulationmaximum common subgraphplanar triangulation graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Computing and Combinatorics
• A polynomial-time algorithm for computing the maximum common subgraph of outerplanar graphs of bounded degree
• Graph-Based Representations in Pattern Recognition
• Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Database of Graphs
• scientific article; zbMATH DE number 2043361

Cited in

(7)

• A branch \& cut algorithm for the maximum common edge subgraph problem
• Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms
• A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs
• Maximum common subgraph isomorphism algorithms
• Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Database of Graphs
• Graph-Based Representations in Pattern Recognition
• Computing and Combinatorics

This page was built for publication: An algorithm for maximum common subgraph of planar triangulation graphs

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