Login / Signup
Finding a Maximum-Weight Convex Set in a Chordal Graph.
Jean Cardinal
Jean-Paul Doignon
Keno Merckx
Published in:
CoRR (2018)
Keyphrases
</>
maximum weight
convex sets
bipartite graph
weighted graph
independent set
minimum weight
partial order
finite number
convex hull
convex optimization
np hard
graph structure
higher dimensional
graph theory
directed acyclic graph
greedy heuristic