The Proportional Colouring Problem: Optimizing Buffers in Wireless Mesh Networks

DOI10.1016/J.ENDM.2008.01.025MaRDI QIDQ3503543zbMATH OpenOpenAlexFDO

Authors Florian Huc, Cláudia L. Sales, Hervé Rivano

Publication date 5 June 2008

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2008.01.025

zbMATH Keywords

edge colouringwireless mesh networkproportional colouring

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Coloring of graphs and hypergraphs (05C15) Network design and communication in computer systems (68M10)

Recommendations

• The proportional coloring problem: optimizing buffers in radio mesh networks
• The min-max edge \(q\)-coloring problem
• The min-max edge \(q\)-coloring problem
• Approximation Algorithms for Maximum Edge Coloring Problem
• Approximation algorithm for maximum edge coloring

Cites work

• scientific article; zbMATH DE number 1944137 (Why is no real title available?)
• A polyhedral approach to edge coloring
• Scheduling to Minimize Interaction Cost
• The NP-Completeness of Edge-Coloring
• The NP-completeness of chromatic index in triangle free graphs with maximum vertex of degree 3

Cited in

(1)

• The proportional coloring problem: optimizing buffers in radio mesh networks

This page was built for publication: The Proportional Colouring Problem: Optimizing Buffers in Wireless Mesh Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3503543)