Edge Coloring and Decompositions of Weighted Graphs
From MaRDI portal
Publication:3541103
DOI10.1007/978-3-540-87744-8_34zbMATH Open1158.05318OpenAlexW2098488162MaRDI QIDQ3541103FDOQ3541103
Authors: Mohit Singh, Uriel Feige
Publication date: 25 November 2008
Published in: Algorithms - ESA 2008 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-87744-8_34
Recommendations
- scientific article; zbMATH DE number 7426494
- Generalized edge-colorings of weighted graphs
- Vertex-coloring edge-weightings of graphs
- From edge colorings to graph decompositions -- results and problems
- Vertex coloring edge-weighted digraphs
- Decompositions of edge-colored complete graphs
- Weighted graph colorings
Cites Work
- Some remarks about factors of graphs
- ``Integer-making theorems
- [a,b]-factors of graphs
- Nonblocking Multirate Networks
- On Nonblocking Multirate Interconnection Networks
- On Multirate Rearrangeable Clos Networks
- On Rearrangeability of Multirate Clos Networks
- Title not available (Why is that?)
- Improved Bounds on Nonblocking 3-Stage Clos Networks
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (12)
- Vertex coloring edge-weighted digraphs
- Densities, matchings, and fractional edge-colorings
- Equitable factorizations of edge-connected graphs
- Edge weights and vertex colours
- Title not available (Why is that?)
- Decomposing edge-colored graphs under color degree constraints
- Title not available (Why is that?)
- A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions
- On weighted bipartite edge coloring
- Generalized hypergraph matching via iterated packing and local ratio
- An approximate König's theorem for edge-coloring weighted bipartite graphs
- Colorful edge decomposition of graphs: some polynomial cases
This page was built for publication: Edge Coloring and Decompositions of Weighted Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3541103)