Graph Sandwich Problem for the Property of Being Well-Covered and Partitionable into k Independent Sets and ℓ Cliques.
Sancrey Rodrigues AlvesFernanda CoutoLuérbio FariaSylvain GravierSulamita KleinUéverton S. SouzaPublished in: LATIN (2020)
Keyphrases
- graph structure
- weighted graph
- anti monotonic
- graph properties
- maximal cliques
- maximum clique
- graph theory
- graph representation
- random walk
- graph model
- directed acyclic graph
- bayesian networks
- dependency graph
- graphical models
- graph partitioning
- graph matching
- edge weights
- global consistency
- directed graph
- graph based algorithm
- connected components
- stable set
- logic programs