scientific article; zbMATH DE number 1786463
From MaRDI portal
Publication:4547754
zbMath0990.68097MaRDI QIDQ4547754
Publication date: 21 August 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2089/20890241
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Problems related to evolution (92D15) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Parameterized enumeration, transversals, and imperfect phylogeny reconstruction ⋮ A fixed-parameter algorithm for minimum quartet inconsistency ⋮ An Efficient Fixed-Parameter Enumeration Algorithm for Weighted Edge Dominating Set ⋮ On the weighted quartet consensus problem ⋮ Comparing trees via crossing minimization
This page was built for publication:
