AN ALMOST LINEAR-TIME ALGORITHM FOR GRAPH REALIZATION

被引：43

作者：

BIXBY, RE ^{[1
]}

WAGNER, DK ^{[1
]}

机构：

[1] PURDUE UNIV, SCH IND ENGN, W LAFAYETTE, IN 47907 USA

来源：

MATHEMATICS OF OPERATIONS RESEARCH | 1988年 / 13卷 / 01期

关键词：

D O I：

10.1287/moor.13.1.99

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：99 / 123

页数：25

共 23 条

[1] CONVERTING LINEAR-PROGRAMS TO NETWORK PROBLEMS [J].

BIXBY, RE ;

CUNNINGHAM, WH .

MATHEMATICS OF OPERATIONS RESEARCH, 1980, 5 (03) :321-357

[2]

BIXBY RE, 1984, PROGR COMBINATORIAL, P39

[3]

BONDY JA, 1976, GRAPH THEORY APPLICA

[4] TESTING FOR CONSECUTIVE ONES PROPERTY, INTERVAL GRAPHS, AND GRAPH PLANARITY USING PQ-TREE ALGORITHMS [J].

BOOTH, KS ;

LUEKER, GS .

JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1976, 13 (03) :335-379

[5] A COMBINATORIAL DECOMPOSITION-THEORY [J].

CUNNINGHAM, WH ;

EDMONDS, J .

CANADIAN JOURNAL OF MATHEMATICS-JOURNAL CANADIEN DE MATHEMATIQUES, 1980, 32 (03) :734-765

[6] SEPARATING COCIRCUITS IN BINARY MATROIDS [J].

CUNNINGHAM, WH .

LINEAR ALGEBRA AND ITS APPLICATIONS, 1982, 43 (MAR) :69-86

[7] AN EFFICIENT PQ-GRAPH ALGORITHM FOR SOLVING THE GRAPH-REALIZATION PROBLEM [J].

FUJISHIGE, S .

JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1980, 21 (01) :63-86

[8]

GABOW HN, 1983, 15TH P ANN ACM S THE, P246

[9] AN ALGORITHM FOR CONSTRUCTING EDGE-TREES FROM HYPERGRAPHS [J].

GAVRIL, F ;

TAMARI, R .

NETWORKS, 1983, 13 (03) :377-388

[10]

Hopcroft J. E., 1973, SIAM Journal on Computing, V2, P135, DOI 10.1137/0202012

← 1 2 3 →