Graphs That Do Not Contain a Cycle with a Node That Has at Least Two Neighbors on It.
Pierre AboulkerMarko RadovanovicNicolas TrotignonKristina VuskovicPublished in: SIAM J. Discret. Math. (2012)
Keyphrases
- directed graph
- graph structure
- finding the shortest path
- undirected graph
- small world networks
- nearest neighbor
- graph theoretic
- graph representation
- nodes of a graph
- graph mining
- graph matching
- weighted graph
- random graphs
- neural network
- data sets
- random walk
- edge weights
- small world
- graph structures
- data points
- intermediate nodes
- labeled graphs
- betweenness centrality
- cooperative