A Near-Optimal Parallel Algorithm for Edge-Coloring Outerplanar Graphs.
Yuval CaspiEliezer DekelPublished in: IPPS (1992)
Keyphrases
- parallel algorithm
- graph mining
- graph patterns
- graph isomorphism
- graph databases
- planar graphs
- frequent subgraphs
- subgraph mining
- subgraph isomorphism
- weighted graph
- graph data
- parallel computation
- pattern mining
- link prediction
- undirected graph
- frequent itemset mining
- graph search
- mining algorithm
- cluster of workstations
- graph model
- graph structure
- connected components
- structured data
- edge weights
- community detection
- pattern discovery
- maximal frequent
- database
- graph theoretic
- rdf data
- similarity search
- search algorithm