Perfect matching for biconnected cubic graphs in \(O(n \log ^{2} n)\) time (Q3401102)
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 5664063
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Perfect matching for biconnected cubic graphs in \(O(n \log ^{2} n)\) time |
scientific article; zbMATH DE number 5664063 |
Statements
Perfect Matching for Biconnected Cubic Graphs in O(n log2 n) Time (English)
0 references
28 January 2010
0 references
0.8161895871162415
0 references
0.8161748647689819
0 references
0.8131773471832275
0 references
0.7842441201210022
0 references
0.7840594053268433
0 references
