An algorithm for computing simple \(k\)-factors (Q987840): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Efficient Algorithms for Petersen's Matching Theorem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4079613 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3684121 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Faster shortest-path algorithms for planar graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Maximum matchings in planar graphs via Gaussian elimination / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The general maximum matching algorithm of Micali and Vazirani / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Graph factors and factorization: 1985--2003: a survey / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Near-optimal fully-dynamic graph connectivity / rank | |||
Normal rank | |||
Latest revision as of 01:53, 3 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for computing simple \(k\)-factors |
scientific article |
Statements
An algorithm for computing simple \(k\)-factors (English)
0 references
16 August 2010
0 references
graph algorithms
0 references
graph factors
0 references
\(k\)-factors
0 references
simple \(k\)-factors
0 references
2-factors
0 references
