A faster algorithm for maximum independent set on interval filament graphs

Darcy Best, Max Ward 0001. A faster algorithm for maximum independent set on interval filament graphs. J. Graph Algorithms Appl., 26(1):199-205, 2022. [doi]

@article{BestW22,
  title = {A faster algorithm for maximum independent set on interval filament graphs},
  author = {Darcy Best and Max Ward 0001},
  year = {2022},
  doi = {10.7155/jgaa.00588},
  url = {https://doi.org/10.7155/jgaa.00588},
  researchr = {https://researchr.org/publication/BestW22},
  cites = {0},
  citedby = {0},
  journal = {J. Graph Algorithms Appl.},
  volume = {26},
  number = {1},
  pages = {199-205},
}