Independent Sets of Maximum Weight in Apple-Free Graphs

Andreas Brandstädt, Tilo Klembt, Vadim V. Lozin, Raffaele Mosca. Independent Sets of Maximum Weight in Apple-Free Graphs. In Seok-Hee Hong, Hiroshi Nagamochi, Takuro Fukunaga, editors, Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings. Volume 5369 of Lecture Notes in Computer Science, pages 848-858, Springer, 2008. [doi]

@inproceedings{BrandstadtKLM08,
  title = {Independent Sets of Maximum Weight in Apple-Free Graphs},
  author = {Andreas Brandstädt and Tilo Klembt and Vadim V. Lozin and Raffaele Mosca},
  year = {2008},
  doi = {10.1007/978-3-540-92182-0_74},
  url = {http://dx.doi.org/10.1007/978-3-540-92182-0_74},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/BrandstadtKLM08},
  cites = {0},
  citedby = {0},
  pages = {848-858},
  booktitle = {Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings},
  editor = {Seok-Hee Hong and Hiroshi Nagamochi and Takuro Fukunaga},
  volume = {5369},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-540-92181-3},
}