An \(O(n)\) time algorithm for maximum matching in \(P_{4}\)-tidy graphs (Q287094)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6585425
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An \(O(n)\) time algorithm for maximum matching in \(P_{4}\)-tidy graphs |
scientific article; zbMATH DE number 6585425 |
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
0.9058688879013062
0 references
0.8965207934379578
0 references
0.8168704509735107
0 references
