ON THE OPTIMAL STRONGLY CONNECTED ORIENTATIONS OF CITY STREET GRAPHS .4. 4 EAST-WEST AVENUES OR NORTH-SOUTH STREETS

被引：24
作者：
ROBERTS, FS
XU, YH
机构：
[1] RUTGERS STATE UNIV,CTR OPERAT RES,NEW BRUNSWICK,NJ 08903
[2] TAIYUAN HEAVY MACHINERY INST,TAIYUAN,PEOPLES R CHINA
来源：
DISCRETE APPLIED MATHEMATICS | 1994年 / 49卷 / 1-3期
关键词：
D O I：
10.1016/0166-218X(94)90217-8
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
We consider strongly connected orientations of the grid graph which has n1 + 1 east-west avenues and n2 + 1 north-south streets. We seek optimal strongly connected orientations according to several different definitions of optimality. In earlier work, such optimal orientations were found for n1, n2 both at least 4, and for n1 = 1 and n1 = 2. Here we consider the remaining case, n1 = 3.
引用
收藏
页码：331 / 356
页数：26
相关论文
共 11 条
[1]  
[Anonymous], 1976, DISCRETE MATH MODELS
[2]   PARALLEL STRONG ORIENTATION OF AN UNDIRECTED GRAPH [J].
ATALLAH, MJ .
INFORMATION PROCESSING LETTERS, 1984, 18 (01) :37-39
[3]   ROBBINS THEOREM FOR MIXED MULTIGRAPHS [J].
BOESCH, F ;
TINDELL, R .
AMERICAN MATHEMATICAL MONTHLY, 1980, 87 (09) :716-719
[4]   STRONGLY CONNECTED ORIENTATIONS OF MIXED MULTIGRAPHS [J].
CHUNG, FRK ;
GAREY, MR ;
TARJAN, RE .
NETWORKS, 1985, 15 (04) :477-484
[5]  
CHVATAL V, 1978, J COMB THEORY B, V24, P61, DOI 10.1016/0095-8956(78)90078-3
[6]  
Robbins H.E., 1939, AM MATH MON, V46, P281, DOI DOI 10.2307/2303897
[7]  
Roberts F.S., 1988, SIAM J DISCRET MATH, V1, P199
[8]   ON THE OPTIMAL STRONGLY CONNECTED ORIENTATIONS OF CITY STREET GRAPHS .3. 3 EAST WEST AVENUES OR NORTH SOUTH STREETS [J].
ROBERTS, FS ;
XU, YH .
NETWORKS, 1992, 22 (02) :109-143
[9]   ON THE OPTIMAL STRONGLY CONNECTED ORIENTATIONS OF CITY STREET GRAPHS .2. 2 EAST WEST AVENUES OR NORTH SOUTH STREETS [J].
ROBERTS, FS ;
XU, YH .
NETWORKS, 1989, 19 (02) :221-233
[10]  
ROBERTS FS, 1978, NSF CBMS MONOGRAPH, V29
12