Enumeration of Maximum Common Subtree Isomorphisms with Polynomial-Delay

DOI10.1007/978-3-319-13075-0_7zbMath1435.05105DBLPconf/isaac/DroschinskyHKM14OpenAlexW170258134WikidataQ56976974 ScholiaQ56976974MaRDI QIDQ2942616

Petra Mutzel, Nils M. Kriege, Bernhard Heinemann, Andre Droschinsky

Publication date: 11 September 2015

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-13075-0_7

zbMATH Keywords

maximum common subgraphEdmonds' algorithm

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

A fast discovery algorithm for large common connected induced subgraphs

This page was built for publication: Enumeration of Maximum Common Subtree Isomorphisms with Polynomial-Delay