Maximum Weight Independent Sets for ($P_7$, Triangle)-Free Graphs in Polynomial Time.
Andreas BrandstädtRaffaele MoscaPublished in: CoRR (2015)
Keyphrases
- maximum weight
- independent set
- bipartite graph matching
- weighted graph
- bipartite graph
- minimum weight
- bipartite matching
- graph matching
- spanning tree
- special case
- partial order
- approximation algorithms
- association graph
- graphical models
- graph theory
- relational databases
- undirected graph
- worst case
- np hard
- polynomial time complexity