Practicably Boosting the Processing Performance of BFS-like Algorithms on Semi-External Graph System via I/O-Efficient Graph Ordering.
Tsun-Yu YangYuhong LiangMing-Chang YangPublished in: FAST (2022)
Keyphrases
- breadth first search
- graph theory
- depth first search
- random walk
- graph representation
- graph structure
- learning algorithm
- partitioning algorithm
- graph search
- random graphs
- minimum spanning tree
- web graph
- search tree
- connected components
- graph matching
- structured data
- graph properties
- social networks
- strongly connected
- graph based algorithm
- maximum clique
- graph structures
- polynomial time complexity
- graph layout
- edge weights
- graph theoretic
- directed graph
- data structure
- graph construction
- maximal cliques
- graph model
- ensemble learning
- computational complexity
- machine learning
- real time