Maximum scan statistics and channel assignment problems in homogeneous wireless networks

DOI10.1016/j.tcs.2009.02.027zbMath1183.68064OpenAlexW1985316525MaRDI QIDQ1019740

Chih-Wei Yi

Publication date: 28 May 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.02.027

zbMATH Keywords

channel assignmentchromatic numbersclique numberswireless ad hoc networksinductivitiesmaximum scan statistics

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (1)

Incidence coloring of mycielskians with fast algorithm

Cites Work

• Unnamed Item
• Unit disk graphs
• On coloring unit disk graphs
• Coverage by randomly deployed wireless sensor networks
• Smallest-last ordering and clustering and graph coloring algorithms
• Simple heuristics for unit disk graphs
• Focusing of the scan statistic and geometric clique number
• Random channel assignment in the plane
• Scan statistics

This page was built for publication: Maximum scan statistics and channel assignment problems in homogeneous wireless networks