Fast edge colorings with fixed number of colors to minimize imbalance
type: Item
instance of: scholarly article
title: Fast edge colorings with fixed number of colors to minimize imbalance
zbMATH Open document ID: 1161.68646
author: Gruia Calinescu
author: Michael J. Pelsmajer
published in: Journal of Graph Algorithms and Applications
publication date: 2009-01-19T00:00:00Z
full work available at URL: CalinescuPelsmajer2008.12.4.pdf
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 5493608
zbMATH Keywords: optimization
zbMATH Keywords: maximum matching computations
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W2000486730
DOI: 10.7155/JGAA.00172
Recommended article: Fast Edge Colorings with Fixed Number of Colors to Minimize Imbalance
Recommended article: A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions
Recommended article: An Efficient Algorithm for the Nearly Equitable Edge Coloring Problem
Recommended article: Fast algorithms for edge-coloring planar graphs
Recommended article: Optimal edge-coloring with edge rate constraints
Recommended article: A simple and fast heuristic algorithm for edge-coloring of graphs
Recommended article: Q3222860
Recommended article: Very fast parallel algorithms for approximate edge coloring
Recommended article: Coloring Graphs with Minimal Edge Load
description: scientific article; zbMATH DE number 5493608