When is Graph Reordering an Optimization? Studying the Effect of Lightweight Graph Reordering Across Applications and Input Graphs.
Vignesh BalajiBrandon LuciaPublished in: IISWC (2018)
Keyphrases
- lightweight
- graph theory
- graph representation
- graph structure
- graph theoretic
- graph mining
- graph structures
- directed graph
- weighted graph
- graph databases
- graph matching
- graph partitioning
- subgraph isomorphism
- labeled graphs
- structured data
- random walk
- minimum spanning tree
- graph data
- spanning tree
- graph model
- bipartite graph
- graph properties
- random graphs
- graph construction
- graph classification
- graph clustering
- graph search
- adjacency matrix
- graph representations
- connected components
- graph isomorphism
- dynamic graph
- connected graphs
- dos attacks
- neighborhood graph
- small world
- adjacency graph
- communication infrastructure
- massive graphs
- maximum common subgraph