An \(O(n)\) time algorithm for maximum matching in \(P_{4}\)-tidy graphs (Q287094): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claims |
||
| Property / author | |||
| Property / author: I. I. Parfenov / rank | |||
| Property / author | |||
| Property / author: Henri Thuillier / rank | |||
| Property / author | |||
| Property / author: Jean-Luc Fouquet / rank | |||
Revision as of 07:01, 11 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(O(n)\) time algorithm for maximum matching in \(P_{4}\)-tidy graphs |
scientific article |
Statements
An \(O(n)\) time algorithm for maximum matching in \(P_{4}\)-tidy graphs (English)
0 references
26 May 2016
0 references
matching
0 references
modular decomposition
0 references
