COMPUTATIONAL-COMPLEXITY OF SOME INTERFERENCE GRAPH CALCULATIONS

被引：7

作者：

GAMST, A

RALF, K

机构：

[1] Philips GmbH Forschungslaboratorium, Hamburg

[2] DETECON GmbH, 5300 Bonn

[3] Philips GmbH Forschungslaboratorium, Hamburg

[4] 2000 Hamburg 54

来源：

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY | 1990年 / 39卷 / 02期

关键词：

D O I：

10.1109/25.54230

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

The amount of work needed to generate the families of complete, maximal complete, independent, and maximal independent subsets of the interference graphs of mobile radio telephone networks is investigated. It is shown that the family of maximal complete subsets can always be computed, while for complete sets, difficulties arise with larger reuse distances, and both the independent and maximal independent sets remain inaccessible except for networks with only little frequency reuse. © 1990 IEEE

引用

页码：140 / 149

页数：10

共 20 条

[1]

ARAKI K, 1968, REV ELEC COMMUN LAB, V16, P357

[2] FINDING ALL CLIQUES OF AN UNDIRECTED GRAPH [H] [J].

BRON, C ;

KERBOSCH, J .

COMMUNICATIONS OF THE ACM, 1973, 16 (09) :575-577

[3]

Cameron S. H., 1977, IEEE Transactions on Electromagnetic Compatibility, VEMC-19, P320, DOI 10.1109/TEMC.1977.303602

[4]

Christofides N., 1975, GRAPH THEORY ALGORIT

[5]

Gamst A., 1985, 35th IEEE Vehicular Technology Conference. Efficiency, Conservation and Productivity (Cat. No. 85CH2037-0), P21, DOI 10.1109/VTC.1985.1623325

[6] SOME LOWER BOUNDS FOR A CLASS OF FREQUENCY ASSIGNMENT PROBLEMS [J].

GAMST, A .

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 1986, 35 (01) :8-14

[7] HOMOGENEOUS DISTRIBUTION OF FREQUENCIES IN A REGULAR HEXAGONAL CELL SYSTEM [J].

GAMST, A .

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 1982, 31 (03) :132-144

[8]

GAMST A, 1982, P GLOBECOM 82, P309

[9]

Garey M.R., 1979, COMPUTERS INTRACTABI, V174

[10]

GREVEL M, 1983, SIEMENS FORSCH ENTW, V12, P298

← 1 2 →