Perfect Matching for Biconnected Cubic Graphs in O(n log2 n) Time (Q3401102)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Perfect Matching for Biconnected Cubic Graphs in O(n log2 n) Time |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Perfect Matching for Biconnected Cubic Graphs in O(n log2 n) Time |
scientific article |
Statements
Perfect Matching for Biconnected Cubic Graphs in O(n log2 n) Time (English)
0 references
28 January 2010
0 references
