Computing asymmetric median tree of two trees via better bipartite matching algorithm
From MaRDI portal
Publication:1642720
DOI10.1007/978-3-319-78825-8_29zbMath1504.68182OpenAlexW2799161558MaRDI QIDQ1642720
Publication date: 15 June 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-78825-8_29
Analysis of algorithms (68W40) Problems related to evolution (92D15) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
This page was built for publication: Computing asymmetric median tree of two trees via better bipartite matching algorithm
