The Degree Diameter Problem for Host-Switch Graphs.
Ryota YasudoKoji NakanoPublished in: CANDAR Workshops (2019)
Keyphrases
- data points
- random graphs
- high speed
- pattern recognition
- graph matching
- graph theoretic
- graph representation
- average degree
- graph clustering
- series parallel
- weighted graph
- graph theory
- preferential attachment
- neural network
- host computer
- subgraph isomorphism
- maximal cliques
- data sets
- adjacency matrix
- spanning tree
- graph databases
- graph mining
- graph structure
- operating system
- machine learning