Approximating Maximum Edge 2-Coloring by Normalizing Graphs

In a simple, undirected graph G, an edge 2-coloring is a coloring of the edges such that no vertex is incident to edges with more than 2 distinct colors. The problem maximum edge 2-coloring (ME2C) is to find an edge 2-coloring in a graph G with the goal to maximize the number of colors. For a releva...

Celý popis

Podrobná bibliografia

Vydané v:	Discrete mathematics and theoretical computer science Ročník 27:2; číslo Discrete Algorithms
Hlavní autori:	Mömke, Tobias, Popa, Alexandru, Roshany-Tabrizi, Aida, Ruderer, Michael, Vincze, Roland
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Discrete Mathematics & Theoretical Computer Science 01.05.2025
Predmet:	computer science - data structures and algorithms computer science - discrete mathematics
ISSN:	1365-8050, 1365-8050
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!