Minimum Leaf Removal for Reconciliation: Complexity and Algorithms

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-31265-6_32
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Complexity and Online Algorithms for Minimum Skyline Coloring of Intervals

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2019English

Two‐stage Stochastic Minimum S − T Cut Problems: Formulations, Complexity and Decomposition Algorithms

Networks
Information SystemsComputer NetworksHardwareCommunicationsArchitectureSoftware
2019English

Algorithms and Complexity

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Coarse-Grained Complexity for Dynamic Algorithms

2020English

Set Reconciliation With Nearly Optimal Communication Complexity

English

Minimum Degree, Leaf Number and Traceability

Czechoslovak Mathematical Journal
Mathematics
2013English

Distributed Minimum Hop Algorithms

1982English

Towards Sub-Quadratic Time and Space Complexity Solutions for the Dated Tree Reconciliation Problem

Algorithms for Molecular Biology
Computational TheoryApplied MathematicsStructural BiologyMolecular BiologyMathematics
2016English

Traveling Salesman Algorithms Complexity

International Journal of Computer Applications
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy