A greedy algorithm for finding a large 2-matching on a random cubic graph.
Deepak BalPatrick BennettTom BohmanAlan M. FriezePublished in: J. Graph Theory (2018)
Keyphrases
- greedy algorithm
- graph matching
- greedy algorithms
- worst case
- objective function
- affinity graph
- greedy strategy
- greedy heuristic
- directed graph
- set cover
- subgraph isomorphism
- influence spread
- graph mining
- knapsack problem
- connected components
- influence maximization
- random walk
- greedy approximation algorithm
- dynamic programming