Rolling Upward Planarity Testing of Strongly Connected Graphs.

Christopher Auer Christian Bachmaier Franz-Josef Brandenburg Kathrin Hanauer

Published in: WG (2013)

Keyphrases

strongly connected
directed graph
optimum path forest
undirected graph
test cases
mathematical model
directed acyclic graph
software testing
neural network
computational complexity
lower bound