An \(O(n)\) time algorithm for maximum matching in \(P_{4}\)-tidy graphs (Q287094): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / author | |||
| Property / author: Jean-Luc Fouquet / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C85 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C70 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68R10 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6585425 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
matching | |||
| Property / zbMATH Keywords: matching / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
modular decomposition | |||
| Property / zbMATH Keywords: modular decomposition / rank | |||
Normal rank | |||
Revision as of 18:54, 27 June 2023
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
