Notes on oriented depth-first search and longest paths

DOI10.1016/0020-0190(89)90109-9zbMath0669.05039OpenAlexW2071681494MaRDI QIDQ1118610

Hiroshi Imai, Hubert de Fraysseix

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1016/0020-0190(89)90109-9

zbMATH Keywords

depth-first searchlongest pathdirected acyclic graphsflowcharts

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Testing flow graph reducibility
• Finding Dominators in Directed Graphs
• Characterizations of Reducible Flow Graphs

This page was built for publication: Notes on oriented depth-first search and longest paths