Recognizing Bellman–Ford-Orderable Graphs

DOI10.1137/0401045zbMath0676.68032OpenAlexW2020839468MaRDI QIDQ3832062

Ramsey W. Haddad, Alejandro A. Schäffer

Publication date: 1988

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0401045

zbMATH Keywords

shortest pathdirected graphdominator treeBellman-Ford algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Directed graphs (digraphs), tournaments (05C20)

Related Items

Lower bounds for non-adaptive shortest path relaxation