Rooted directed path graphs are leaf powers.

Andreas Brandstädt Christian Hundt Federico Mancini Peter Wagner

Published in: Discret. Math. (2010)

Keyphrases

complex structures
strongly connected
decision trees
search algorithm
shortest path
graph theory
graph structure
graph mining
neural network
website
random walk
graph matching
endpoints
undirected graph
graph representation
graph theoretic