A scalable approach to computing representative lowest common ancestor in directed acyclic graphs

No abstract is available for this paper.

• Publication year

  2013

• Venue

  Theoretical Computer Science

• Publication date

  2013-11-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1016/J.TCS.2013.09.030
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Multiplying matrices faster than coppersmith-winograd

  2012cited by this paper
• Introduction to Algorithms, third edition

  2009cited by this paper
• A Path Cover Technique for LCAs in Dags

  2008cited by this paper
• Faster algorithms for finding lowest common ancestors in directed acyclic graphs

  2007influential reference
• Fast Lowest Common Ancestor Computations in Dags

  2007cited by this paper
• All-Pairs Ancestor Problems in Weighted Dags

  2007cited by this paper
• Unique Lowest Common Ancestors in Dags Are Almost as Easy as Matrix Multiplication

  2007cited by this paper
• Dual Labeling: Answering Graph Reachability Queries in Constant Time

  2006influential reference
• Lowest common ancestors in trees and directed acyclic graphs

  2005cited by this paper
• Nearest common ancestors: a survey and a new distributed algorithm

  2002cited by this paper
• The LCA Problem Revisited

  2000cited by this paper
• Rectangular Matrix Multiplication Revisited

  1997cited by this paper
• Introduction to algorithms

  1996cited by this paper
• Recursive Star-Tree Parallel Data Structure

  1993influential reference
• On Finding Lowest Common Ancestors: Simplification and Parallelization

  1988cited by this paper
• Matrix multiplication via arithmetic progressions

  1987cited by this paper
• Scaling and related techniques for geometry problems

  1984cited by this paper
• Fast Algorithms for Finding Nearest Common Ancestors

  1984cited by this paper
• On the Maximal Number of Strongly Independent Vertices in a Random Acyclic Directed Graph

  1984cited by this paper

• Conformal Prediction in Hierarchical Classification

  2025cites this paper
• Salivary proteomics and metaproteomics identifies distinct molecular and taxonomic signatures of type-2 diabetes

  2025cites this paper
• Pseudo-polynomial algorithms for solving the Knapsack Problem with dependencies between items

  2023cites this paper
• SAT Solving Using XOR-OR-AND Normal Forms

  2023cites this paper
• On MatBase’s algorithm for preventing cycles in binary Cartesian function products

  2022cites this paper
• Semantic Similarity of Concepts for a Human-Centered Idea Recommendation Feature in the Clustering Application Orchard

  2020cites this paper
• All-Pairs LCA in DAGs: Breaking through the O(n2.5) barrier

  2020cites this paper
• A Perspective on Comparative and Functional Genomics

  2019cites this paper
• An efficient, large-scale, non-lattice-detection algorithm for exhaustive structural auditing of biomedical ontologies

  2018cites this paper
• A Comparative Study of Algorithm for Computing Strongly Connected Components

  2017cites this paper