Finding smallest supertrees
From MaRDI portal
Publication:6487952
DOI10.1007/BFB0015414zbMATH Open1512.68069MaRDI QIDQ6487952FDOQ6487952
Authors: Arvind Kumar Gupta, N. Nishimura 
Publication date: 21 March 2023
Recommendations
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)
Cites Work
- Faster Scaling Algorithms for Network Problems
- Finding largest common embeddable subtrees
- Title not available (Why is that?)
- Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
- The Parallel Evaluation of General Arithmetic Expressions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Subtree Isomorphism in O(n5/2)
- An improved parallel algorithm that computes the BFS numbering of a directed graph
- Title not available (Why is that?)
- Subtree isomorphism is in random NC
- Subtree isomorphism is NC reducible to bipartite perfect matching
- An Analysis of a Good Algorithm for the Subtree Problem
- 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
- An Analysis of a Good Algorithm for the Subtree Problem, Corrected
- The Parallel Complexity of Tree Embedding Problems
Cited In (4)
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)
