Abstract
The demand fur communication services is rapidly increasing, because the mobile communication service is synonymous of an ideal communication style realizing communication in any time, any where and with anyone. There exist various problems to which computational geometry and graph and network theory is applicable in mobile communication services. For example, it is well known that coloring algorithms of graphs are applicable in channel assignment algorithms in cellular systems. In this paper, we show new results in graph theoretic or computational geometric research of cellular mobile communications.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
