Finding smallest supertrees

DOI10.1007/BFB0015414MaRDI QIDQ6487952zbMATH OpenFDO

Authors Arvind Kumar Gupta, N. Nishimura

Publication date 21 March 2023

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Data structures (68P05) Nonnumerical algorithms (68W05) Parallel algorithms in computer science (68W10)

Recommendations

• Finding largest subtrees and smallest supertrees
• scientific article; zbMATH DE number 1746436
• Finding smallest supertrees under minor containment
• Publication:4944989
• A supertree method for rooted trees

Cites work

• scientific article; zbMATH DE number 1638647 (Why is no real title available?)
• scientific article; zbMATH DE number 1003280 (Why is no real title available?)
• scientific article; zbMATH DE number 434699 (Why is no real title available?)
• scientific article; zbMATH DE number 437563 (Why is no real title available?)
• An Analysis of a Good Algorithm for the Subtree Problem
• An Analysis of a Good Algorithm for the Subtree Problem, Corrected
• An improved parallel algorithm that computes the BFS numbering of a directed graph
• Faster Scaling Algorithms for Network Problems
• Finding largest common embeddable subtrees
• O(n2.5) time algorithms for the subgraph homeomorphism problem on trees
• Sequential and parallel algorithms for embedding problems on classes of partial k-trees
• Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
• Subtree Isomorphism in O(n5/2)
• Subtree isomorphism is NC reducible to bipartite perfect matching
• Subtree isomorphism is in random NC
• The Parallel Complexity of Tree Embedding Problems
• The Parallel Evaluation of General Arithmetic Expressions

Cited in

(4)

• scientific article; zbMATH DE number 1420917 (Why is no real title available?)
• scientific article; zbMATH DE number 7564377 (Why is no real title available?)
• Finding smallest supertrees under minor containment
• A 6-Approximation Algorithm for Computing Smallest Common AoN-Supertree with Application to the Reconstruction of Glycan Trees

This page was built for publication: Finding smallest supertrees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487952)