Bisectored unit disk graphs

DOI10.1002/NET.10111MaRDI QIDQ4474290zbMATH OpenOpenAlexFDO

Authors

Publication date 4 August 2004

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.10111

zbMATH Keywords

channel assignmentcoloringsfrequency assignmentunit disk graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Applications of graph theory (05C90) Network design and communication in computer systems (68M10) Communication networks in operations research (90B18) Communication theory (94A05)

Recommendations

• scientific article; zbMATH DE number 1769307
• On coloring unit disk graphs
• ROMAN DOMINATION AND ITS VARIANTS IN UNIT DISK GRAPHS
• Random channel assignment in the plane
• Unit disk graphs

Cites work

• Robust algorithms for restricted domains
• Smallest-last ordering and clustering and graph coloring algorithms
• Unit disk graph recognition is NP-hard

This page was built for publication: Bisectored unit disk graphs

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