Reconstruction of rooted trees from subtrees (Q1923599): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / reviewed by
 
Property / reviewed by: Peter Kirschenhofer / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Peter Kirschenhofer / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for supertrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138927 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023849 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of reconstructing trees from qualitative characters and subtrees / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:05, 24 May 2024

scientific article
Language Label Description Also known as
English
Reconstruction of rooted trees from subtrees
scientific article

    Statements

    Reconstruction of rooted trees from subtrees (English)
    0 references
    0 references
    0 references
    25 November 1996
    0 references
    An algorithm is presented for finding all rooted trees with labelled endnodes having subtrees homeomorphic to each of a given set of rooted trees with labelled endnodes.
    0 references
    reconstruction of rooted trees
    0 references
    rooted trees
    0 references

    Identifiers