Orienting graphs to optimize reachability

Information Processing Letters

Volumn 63, Issue 5, 1997, Pages 229-235

  Hakimi, S Louis ^a   Schmeichel, Edward F ^b   Young, Neal E ^c  

^a University of California   (United States)

^b SAN JOSE STATE UNIVERSITY   (United States)

^c Dartmouth Department of Computer Science_Dartmouth College   (United States)

Author keywords

Algorithms; Computational complexity; Orientation

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; MATHEMATICAL TRANSFORMATIONS; THEOREM PROVING;

ORIENTING GRAPHS;

GRAPH THEORY;

EID: 0031223163     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(97)00129-4     Document Type: Article

References (12)

1. C. Berge, Graphs and Hypergraphs (North-Holland, Amsterdam, 1973).
2. J.A. Bondy and U.S.R. Murty, Graph Theory with Applications (North-Holland, Amsterdam, 1976).
3. S. Even, A. Pnueli and A. Lempel, Permutation graphs and transitive graphs, J. ACM 19 (1972) 400-410.
4. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to NP-Completeness (Freeman, San Francisco, 1979).
5. P.C. Gilmore and A.J. Hoffman, A characterization of comparability graphs and of interval graphs, Canad. J. Math. 16 (1964) 539-548.
6. M.C. Golumbic, H. Kaplan and R. Shamir, Graph sandwich problems, J. Algorithms 19 (1995) 449-473.
7. O.H. Ibarra and C.E. Kim, Fast approximation algorithms for the knapsack and sum of subset problems, J. ACM 22 (1975) 463-468.
8. V. Kann, J. Lagergren and A. Panconesi, Approximability of maximum splitting of k-sets and some other APX-complete problems, Tech. Rept. TRITA-NA-P9509, Dept. of Numerical Analysis and Computer Science, Royal Institute of Technology, Stockholm.
9. O. Kariv and S.L. Hakimi, An algorithmic approach to network location problems, II: The p-medians, SIAM J. Appl. Math. 37 (1979) 539-560.
10. P. Dell'Olmo, M. Grazia Speranza and Z. Tuza, Comparability graph augmentation for some multiprocessor scheduling problems, Discrete Appl. Math. 72 (1997) 71-84.
11. C.H. Papadimitriou and M. Yannakakis, Optimization, approximation and complexity classes, J. Comput. Systems Sci. 43 (1991) 425-440.
12. H.E. Robbins, A theorem on graphs with an application to a problem of traffic control, Amer. Math. Monthly 46 (1939) 281-283.