Automata, Languages and Programming

DOI10.1007/11523468zbMath1082.68593OpenAlexW2940595899WikidataQ56656999 ScholiaQ56656999MaRDI QIDQ5716778

Mirosław Kowaluk, Andrzej Lingas

Publication date: 10 January 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11523468

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (6)

Faster algorithms for finding lowest common ancestors in directed acyclic graphs ⋮ A Path Cover Technique for LCAs in Dags ⋮ All-pairs bottleneck paths in vertex weighted graphs ⋮ A fast output-sensitive algorithm for Boolean matrix multiplication ⋮ All-pairs disjoint paths from a common ancestor in \(\widetilde O (n^\omega)\) time ⋮ On minimum witnesses for Boolean matrix multiplication

This page was built for publication: Automata, Languages and Programming