scientific article; zbMATH DE number 6851866
From MaRDI portal
Publication:4608592
DOI10.4230/LIPIcs.MFCS.2016.33zbMath1398.05196arXiv1602.07210MaRDI QIDQ4608592
Andre Droschinsky, Petra Mutzel, Nils M. Kriege
Publication date: 21 March 2018
Full work available at URL: https://arxiv.org/abs/1602.07210
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Enumeration in graph theory (05C30) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items
Finding Largest Common Substructures of Molecules in Quadratic Time, A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs, Fixed-parameter tractability for the Tree Assembly problem, Largest Weight Common Subtree Embeddings with Distance Penalties
