Finding smallest supertrees
From MaRDI portal
Publication:6487952
DOI10.1007/BFB0015414zbMath1512.68069MaRDI QIDQ6487952
Naomi Nishimura, Arvind Kumar Gupta
Publication date: 21 March 2023
Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Data structures (68P05)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Subtree isomorphism is in random NC
- An improved parallel algorithm that computes the BFS numbering of a directed graph
- Subtree isomorphism is NC reducible to bipartite perfect matching
- Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
- O(n2.5) time algorithms for the subgraph homeomorphism problem on trees
- An Analysis of a Good Algorithm for the Subtree Problem, Corrected
- An Analysis of a Good Algorithm for the Subtree Problem
- Subtree Isomorphism in O(n5/2)
- The Parallel Complexity of Tree Embedding Problems
- The Parallel Evaluation of General Arithmetic Expressions
- Finding largest common embeddable subtrees
- Faster Scaling Algorithms for Network Problems
- Sequential and parallel algorithms for embedding problems on classes of partial k-trees
This page was built for publication: Finding smallest supertrees
