AN ALGORITHM FOR CONSTRUCTING EDGE-TREES FROM HYPERGRAPHS

被引：11

作者：

GAVRIL, F

TAMARI, R

机构：

来源：

NETWORKS | 1983年 / 13卷 / 03期

关键词：

D O I：

10.1002/net.3230130306

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：377 / 388

页数：12

共 13 条

[1]

Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st

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

BIXBY, RE ;

CUNNINGHAM, WH .

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

[3] GRAPHIC MATROIDS AND MULTICOMMODITY TRANSPORTATION PROBLEM [J].

EVANS, JR ;

JARVIS, JJ ;

DUKE, RA .

MATHEMATICAL PROGRAMMING, 1977, 13 (03) :323-328

[4]

GAVRIL F, 1978, DISCRETE MATH, V23, P211, DOI 10.1016/0012-365X(78)90003-1

[5] RECOGNITION ALGORITHM FOR INTERSECTION GRAPHS OF DIRECTED PATHS IN DIRECTED TREES [J].

GAVRIL, F .

DISCRETE MATHEMATICS, 1975, 13 (03) :237-249

[6]

Golumbic M. C., 1980, ALGORITHMIC GRAPH TH

[7] TRANSITIVE ORIENTATION OF GRAPHS AND IDENTIFICATION OF PERMUTATION GRAPHS [J].

PNUELI, A ;

LEMPEL, A ;

EVEN, S .

CANADIAN JOURNAL OF MATHEMATICS, 1971, 23 (01) :160-&

[8]

ROBERTS FS, 1980, DISCRETE MATH MODELS

[9] RECOGNIZING GRAPHIC MATROIDS [J].

SEYMOUR, PD .

COMBINATORICA, 1981, 1 (01) :75-78

[10]

TAMARI R, TR343 CORN U SCH OP

← 1 2 →