Maximum Matching in Almost Linear Time on Graphs of Bounded Clique-Width.
Guillaume DucoffePublished in: Algorithmica (2022)
Keyphrases
- maximum matching
- bipartite graph
- maximum weight
- independent set
- stable set
- maximum clique
- link prediction
- bounded treewidth
- minimum weight
- quasi cliques
- graph properties
- worst case
- graph theoretic
- fixed parameter tractable
- social networks
- spanning tree
- graph databases
- graph theory
- directed graph
- graphical models
- simulated annealing
- relational databases