Maximum Matching in Almost Linear Time on Graphs of Bounded Clique-Width

Guillaume Ducoffe . Maximum Matching in Almost Linear Time on Graphs of Bounded Clique-Width. Algorithmica, 84(11):3489-3520, 2022. [doi]

@article{Ducoffe22a,
  title = {Maximum Matching in Almost Linear Time on Graphs of Bounded Clique-Width},
  author = {Guillaume  Ducoffe },
  year = {2022},
  doi = {10.1007/s00453-022-00999-9},
  url = {https://doi.org/10.1007/s00453-022-00999-9},
  researchr = {https://researchr.org/publication/Ducoffe22a},
  cites = {0},
  citedby = {0},
  journal = {Algorithmica},
  volume = {84},
  number = {11},
  pages = {3489-3520},
}