Single-Purpose Algorithms vs. a Generic Graph Summarizer for Computing k-Bisimulations on Large Graphs.
Jannik RauDavid RicherbyAnsgar ScherpPublished in: CoRR (2022)
Keyphrases
- graph theory
- graph search
- graph properties
- graph isomorphism
- directed graph
- graph construction
- labeled graphs
- series parallel
- random graphs
- graph structure
- graph databases
- polynomial time complexity
- learning algorithm
- graph matching
- graph structures
- minimum spanning tree
- graph data
- edge weights
- graph representation
- weighted graph
- graph mining
- graph embedding
- strongly connected
- association graph
- graph classification
- maximum clique
- web graph
- dynamic graph
- graph layout
- strongly connected components
- maximum cardinality