The use of a pruned modular decomposition for Maximum Matching algorithms on some graph classes

Guillaume Ducoffe , Alexandru Popa 0001. The use of a pruned modular decomposition for Maximum Matching algorithms on some graph classes. Discrete Applied Mathematics, 291:201-222, 2021. [doi]

@article{DucoffeP21,
  title = {The use of a pruned modular decomposition for Maximum Matching algorithms on some graph classes},
  author = {Guillaume  Ducoffe  and Alexandru Popa 0001},
  year = {2021},
  doi = {10.1016/j.dam.2020.12.018},
  url = {https://doi.org/10.1016/j.dam.2020.12.018},
  researchr = {https://researchr.org/publication/DucoffeP21},
  cites = {0},
  citedby = {0},
  journal = {Discrete Applied Mathematics},
  volume = {291},
  pages = {201-222},
}