GRAPH SPANNERS

被引：401

作者：

PELEG, D

SCHAFFER, AA

机构：

来源：

关键词：

D O I：

10.1002/jgt.3190130114

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

页码：99 / 116

页数：18

共 14 条

[1] COMPLEXITY OF NETWORK SYNCHRONIZATION [J].

AWERBUCH, B .

[2]

Bhatt S., 1986, 27th Annual Symposium on Foundations of Computer Science (Cat. No.86CH2354-9), P274, DOI 10.1109/SFCS.1986.38

[3]

Bollobas B., 1978, LONDON MATH SOC MONO, V11

[4]

Buneman P., 1974, Discrete Mathematics, V9, P205, DOI 10.1016/0012-365X(74)90002-8

[5]

CHEW LP, 1986, 2ND P ANN S COMP GEO, P169

[6]

Dobkin D. P., 1987, 28th Annual Symposium on Foundations of Computer Science (Cat. No.87CH2471-1), P20, DOI 10.1109/SFCS.1987.18

[7]

Garey M. R., 1979, COMPUTERS INTRACTABI

[8]

Gavril F., 1974, Journal of Combinatorial Theory, Series B, V16, P47, DOI 10.1016/0095-8956(74)90094-X

[9] A SEPARATOR THEOREM FOR CHORDAL GRAPHS [J].

GILBERT, JR ;

ROSE, DJ ;

EDENBRANDT, A .

SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1984, 5 (03) :306-313

[10]

Golumbic M. C., 1980, ALGORITHMIC GRAPH TH