Login / Signup
Describing short paths in plane graphs of girth at least 5.
Stanislav Jendrol'
Mária Maceková
Published in:
Discret. Math. (2015)
Keyphrases
</>
three dimensional
shortest path
graph matching
graph mining
graph theoretic
series parallel
directed graph
graph theory
graph representation
optimal path
path length
data mining
search algorithm
graph partitioning
random graphs
structured objects