Finding smallest supertrees (Q6487952): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/bfb0015414 / rank
Normal rank
 
Property / cites work
 
Property / cites work: The Parallel Evaluation of General Arithmetic Expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: O(n2.5) time algorithms for the subgraph homeomorphism problem on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128909 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Scaling Algorithms for Network Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved parallel algorithm that computes the BFS numbering of a directed graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subtree isomorphism is in random NC / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding largest common embeddable subtrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Parallel Complexity of Tree Embedding Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential and parallel algorithms for embedding problems on classes of partial k-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2736344 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3139538 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subtree isomorphism is NC reducible to bipartite perfect matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subtree Isomorphism in O(n5/2) / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of a Good Algorithm for the Subtree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of a Good Algorithm for the Subtree Problem, Corrected / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140442 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Fast Algorithms for the Editing Distance between Trees and Related Problems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/BFB0015414 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:47, 30 December 2024

scientific article; zbMATH DE number 7666504
Language Label Description Also known as
English
Finding smallest supertrees
scientific article; zbMATH DE number 7666504

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references