All-Pairs Ancestor Problems in Weighted Dags

DOI10.1007/978-3-540-74450-4_26zbMath1176.05074OpenAlexW1540873089MaRDI QIDQ3611919

Johannes Nowak, Matthias Baumgart, Sven Kosub, Jan Griebsch, Stefan Eckhardt

Publication date: 3 March 2009

Published in: Combinatorics, Algorithms, Probabilistic and Experimental Methodologies (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74450-4_26

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Related Items (4)

A scalable approach to computing representative lowest common ancestor in directed acyclic graphs ⋮ A Path Cover Technique for LCAs in Dags ⋮ A \(\min\)-\(\max\) relation in flowgraphs and some applications ⋮ New common ancestor problems in trees and directed acyclic graphs

This page was built for publication: All-Pairs Ancestor Problems in Weighted Dags