An \(O(n)\) time algorithm for maximum matching in \(P_{4}\)-tidy graphs (Q287094): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 23:56, 4 March 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
