An optimal algorithm for sink-finding

DOI10.1016/0020-0190(82)90064-3zbMath0487.68056OpenAlexW2067384054MaRDI QIDQ1165583

K. N. King, Barbara V. Smith Thomas

Publication date: 1982

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(82)90064-3

zbMATH Keywords

graph algorithmadjacency matrixoracleAnderaa-Rosenberg conjecturetournament-based algorithm for sink-finding

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Algorithms in computer science (68W99)

Related Items (2)

Tight bounds for finding degrees from the adjacency matrix ⋮ Combinatorial analysis (nonnegative matrices, algorithmic problems)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An optimal algorithm for sink-finding