Minimum multiplicity edge coloring via orientation
DOI10.1016/j.dam.2018.03.078zbMath1394.05029OpenAlexW2884690846WikidataQ129529827 ScholiaQ129529827MaRDI QIDQ1671364
Christina Karousatou, Katerina Potika, Evangelos Bampas, Aris Pagourtzis
Publication date: 6 September 2018
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2018.03.078
edge coloringoptical networksapproximation algorithmsedge orientationcolor multiplicitypath multicoloring
Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Cites Work
- Link scheduling in wireless sensor networks: distributed edge-coloring revisited
- The edge intersection graphs of paths in a tree
- Routing and path multicoloring
- Computer science today. Recent trends and developments
- Routing and wavelength assignment in multifiber WDM networks with non-uniform fiber cost
- Minimizing maximum fiber requirement in optical networks
- Scheduling File Transfers
- A fast parallel algorithm for routing in permutation networks
- Expected Length of the Longest Probe Sequence in Hash Code Searching
- The NP-Completeness of Edge-Coloring
- Using euler partitions to edge color bipartite multigraphs
- NP completeness of finding the chromatic index of regular graphs
- Selfish Resource Allocation in Optical Networks
- Graph-Theoretic Concepts in Computer Science
- The complexity of path coloring and call scheduling
This page was built for publication: Minimum multiplicity edge coloring via orientation
