題名: Cellular Networks Modeled by Distance Hereditary Graphs Are Maximum-Clique Perfect
作者: Lee, Chuan-Min
關鍵字: Algorithm
Maximum-Clique Transversal Set
Maximum-Clique Independent Set
Distance-Hereditary Graph
期刊名/會議名稱: 2008 ICS會議
摘要: In modern cellular telecommunications systems, the entire service area of a country is divided into cells. Cells are normally thought of as hexagonal grids. One common method used to place transmitters for cellular telephones is to place them at the corner points of each hexagonal grid. Motivated by the placement of transmitters for cellular telephones, Chang, Kloks, and Lee introduced the concept of maximum-clique transversal sets on graphs in 2001. In this paper, we show that cellular networks modeled by distance-hereditary graphs are maximum-clique perfect. The maximum-clique transversal number and the maximum-clique independence number of a distance hereditary graph can be computed in linear time.
日期: 2009-02-11T08:06:58Z
分類:2008年 ICS 國際計算機會議

文件中的檔案:
檔案 描述 大小格式 
ce07ics002008000125.pdf95.46 kBAdobe PDF檢視/開啟


在 DSpace 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。