2000 character limit reached
Algorithms For Longest Chains In Pseudo- Transitive Graphs (1701.05286v1)
Published 19 Jan 2017 in cs.CG and math.CO
Abstract: A directed acyclic graph G = (V, E) is pseudo-transitive with respect to a given subset of edges E1, if for any edge ab in E1 and any edge bc in E, we have ac in E. We give algorithms for computing longest chains and demonstrate geometric applications that unify and improves some important past results. (For specific applications see the introduction.)
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
