An \(O(n)\) time algorithm for maximum matching in \(P_{4}\)-tidy graphs (Q287094): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0020-0190(97)00081-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2062510888 / rank | |||
Normal rank | |||
Latest revision as of 10:35, 30 July 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
