"An O(n) Time Algorithm for Maximum Matching in P₄-Tidy Graphs."

Jean-Luc Fouquet, Igor Parfenoff, Henri Thuillier (1997)

> Home

Details and statistics

DOI: 10.1016/S0020-0190(97)00081-1

access: closed

type: Journal Article

metadata version: 2017-05-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ipl/FouquetPT97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/FouquetPT97
Jean-Luc Fouquet, Igor Parfenoff, Henri Thuillier:
An O(n) Time Algorithm for Maximum Matching in P₄-Tidy Graphs. Inf. Process. Lett. 62(6): 281-287 (1997)

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.