On mirror nodes in graphs without long induced paths.
Katharina HammersenBert RanderathPublished in: Australas. J Comb. (2013)
Keyphrases
- shortest path
- directed graph
- graph structure
- weighted graph
- undirected graph
- graph structures
- finding the shortest path
- random graphs
- path length
- adjacency matrix
- fully connected
- connected graphs
- graph matching
- attributed graphs
- small world
- average degree
- disjoint paths
- spanning tree
- real world graphs
- edge weights
- small world networks
- graph theoretic
- real world networks
- random walk
- minimum cost
- strongly connected
- massive graphs
- labeled trees
- directed edges
- planar graphs
- graph clustering
- graph databases
- graph mining
- directed acyclic graph
- bipartite graph
- connected components