Wide diameter of Cartesian graph bundles.
Iztok BanicJanez ZerovnikPublished in: Discret. Math. (2010)
Keyphrases
- graph representation
- graph theory
- average degree
- weighted graph
- graph structure
- connected components
- wide range
- random walk
- stable set
- database
- graph model
- graph databases
- spanning tree
- graph partitioning
- graph search
- minimum spanning tree
- directed acyclic graph
- random graphs
- graph theoretic
- graph mining
- structured data
- search engine
- neural network
- data sets
- real time