Login / Signup
Algorithms and Bounds for L-Drawings of Directed Graphs.
Patrizio Angelini
Giordano Da Lozzo
Marco Di Bartolomeo
Valentino Di Donato
Maurizio Patrignani
Vincenzo Roselli
Ioannis G. Tollis
Published in:
Int. J. Found. Comput. Sci. (2018)
Keyphrases
</>
directed graph
learning algorithm
worst case
theoretical analysis
data mining
data mining techniques
machine learning algorithms
upper and lower bounds
maximum flow
lower bound
information extraction
computationally efficient
orders of magnitude
strongly connected