An improved approximation algorithm for maximum edge 2-coloring in simple graphs (Q935838): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4411281 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Complexity of Recognizing Equal Unions in Families of Sets / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Path factors in cubic graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An approximation algorithm for maximum \(P_{3}\)-packing in subcubic graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3799261 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4945523 / rank | |||
Normal rank | |||
Latest revision as of 13:23, 28 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An improved approximation algorithm for maximum edge 2-coloring in simple graphs |
scientific article |
Statements
An improved approximation algorithm for maximum edge 2-coloring in simple graphs (English)
0 references
8 August 2008
0 references
approximation algorithms
0 references
maximum edge \(t\)-coloring
0 references
maximum \(b\)-matching
0 references
randomization
0 references
derandomization
0 references
