Finding a Maximum-Weight Convex Set in a Chordal Graph

Jean Cardinal, Jean-Paul Doignon, Keno Merckx. Finding a Maximum-Weight Convex Set in a Chordal Graph. J. Graph Algorithms Appl., 23(2):167-190, 2019. [doi]

@article{CardinalDM19,
  title = {Finding a Maximum-Weight Convex Set in a Chordal Graph},
  author = {Jean Cardinal and Jean-Paul Doignon and Keno Merckx},
  year = {2019},
  doi = {10.7155/jgaa.00488},
  url = {https://doi.org/10.7155/jgaa.00488},
  researchr = {https://researchr.org/publication/CardinalDM19},
  cites = {0},
  citedby = {0},
  journal = {J. Graph Algorithms Appl.},
  volume = {23},
  number = {2},
  pages = {167-190},
}