Complexity of Splits Reconstruction for Low-Degree Trees (Q3104774): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A 6-Approximation Algorithm for Computing Smallest Common AoN-Supertree with Application to the Reconstruction of Glycan Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3998309 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Wiener index of trees: Theory and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterizing by the number of numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952629 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multigraph realizations of degree sequences: Maximization is easy, minimization is hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deconstructing Intractability: A Case Study for Interval Constrained Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4830189 / rank
 
Normal rank

Latest revision as of 18:40, 4 July 2024

scientific article
Language Label Description Also known as
English
Complexity of Splits Reconstruction for Low-Degree Trees
scientific article

    Statements

    Complexity of Splits Reconstruction for Low-Degree Trees (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    16 December 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    vertex-weighted tree
    0 references
    libraries of chemical compounds
    0 references
    0 references
    0 references
    0 references