Minimum multiplicity edge coloring via orientation
From MaRDI portal
Publication:1671364
Recommendations
- Fast edge colorings with fixed number of colors to minimize imbalance
- Fast Edge Colorings with Fixed Number of Colors to Minimize Imbalance
- scientific article; zbMATH DE number 1947051
- An asymptotic approximation scheme for multigraph edge coloring
- Approximation Algorithms for Maximum Edge Coloring Problem
Cites work
- A fast parallel algorithm for routing in permutation networks
- Computer science today. Recent trends and developments
- Expected Length of the Longest Probe Sequence in Hash Code Searching
- Link scheduling in wireless sensor networks: distributed edge-coloring revisited
- Minimizing maximum fiber requirement in optical networks
- NP completeness of finding the chromatic index of regular graphs
- Resource allocation problems in multifiber WDM tree networks.
- Routing and path multicoloring
- Routing and wavelength assignment in multifiber WDM networks with non-uniform fiber cost
- Scheduling File Transfers
- Selfish resource allocation in optical networks
- The complexity of path coloring and call scheduling
- The edge intersection graphs of paths in a tree
- The NP-Completeness of Edge-Coloring
- Using euler partitions to edge color bipartite multigraphs
This page was built for publication: Minimum multiplicity edge coloring via orientation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1671364)