Maximum Weight Independent Sets for (, triangle)-free graphs in polynomial time.
Andreas BrandstädtRaffaele MoscaPublished in: Discret. Appl. Math. (2018)
Keyphrases
- maximum weight
- independent set
- bipartite graph matching
- bipartite graph
- weighted graph
- bipartite matching
- minimum weight
- partial order
- graph matching
- special case
- computational complexity
- spanning tree
- np hard
- polynomial time complexity
- directed graph
- bayesian networks
- network structure
- multi dimensional
- minimum spanning tree
- worst case
- probabilistic model