Distance edge coloring and collision-free communication in wireless sensor networks
DOI10.1002/NET.21491zbMATH Open1269.68038OpenAlexW2071409134MaRDI QIDQ5326804FDOQ5326804
Authors: Kaouther Drira, Hamida Seba, Brice Effantin, H. Kheddouci 
Publication date: 6 August 2013
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.21491
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15) Network design and communication in computer systems (68M10)
Cites Work
- Labelling Graphs with a Condition at Distance 2
- Chromatic graph theory
- Radio number for trees
- Radio labelings of graphs
- Link scheduling in polynomial time
- Nearly optimal distributed edge coloring in O(log log n) rounds
- The \(L(2,1)\)-labeling of \(K_{1,n}\)-free graphs and its applications
- \(L(2,1)\)-labelling of generalized prisms
- The local nature of \(\Delta\)-coloring and its algorithmic applications
- Some complexity results about packet radio networks (Corresp.)
- Link scheduling in wireless sensor networks: distributed edge-coloring revisited
- On \(L(2,1)\)-coloring split, chordal bipartite, and weakly chordal graphs
- Algorithms for finding distance-edge-colorings of graphs
- Some maximum multigraphs and adge/vertex distance colourings
- Local structures in plane maps and distance colourings
- On distance edge-colourings and matchings
- Distance edge coloring of the Kronecker product of some graphs
Cited In (2)
This page was built for publication: Distance edge coloring and collision-free communication in wireless sensor networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5326804)
