Largest Weight Common Subtree Embeddings with Distance Penalties
From MaRDI portal
Publication:5005156
DOI10.4230/LIPIcs.MFCS.2018.54OpenAlexW2962906985MaRDI QIDQ5005156
Andre Droschinsky, Nils M. Kriege, Petra Mutzel
Publication date: 4 August 2021
Full work available at URL: https://arxiv.org/abs/1805.00821
maximum weight matchingtopological embeddingsubtree homeomorphismmaximum common subtreelargest embeddable subtree
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding the maximum common subgraph of a partial \(k\)-tree and a graph with a polynomially bounded number of spanning trees
- Finding largest subtrees and smallest supertrees
- Minimum-cost flows in unit-capacity networks
- A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics
- The maximum agreement subtree problem
- An Even Faster and More Unifying Algorithm for Comparing Trees via Unbalanced Bipartite Matchings
- Finding Largest Common Substructures of Molecules in Quadratic Time
- O(n2.5) time algorithms for the subgraph homeomorphism problem on trees
- Subtree Isomorphism in O(n5/2)
This page was built for publication: Largest Weight Common Subtree Embeddings with Distance Penalties