Graphs that do not contain a cycle with a node that has at least two neighbors on it.
Pierre AboulkerMarko RadovanovicNicolas TrotignonKristina VuskovicPublished in: CoRR (2013)
Keyphrases
- directed graph
- graph structure
- finding the shortest path
- nearest neighbor
- undirected graph
- small world networks
- edge weights
- graph model
- graph theoretic
- spanning tree
- graph structures
- random graphs
- graph databases
- graph representation
- graph matching
- graph theory
- shortest path
- degree distribution
- random walk
- np complete