Determining bar-representability for ordered weighted graphs

Computational Geometry: Theory and Applications

Volumn 6, Issue 2, 1996, Pages 99-122

  Kirkpatrick, David G ^a   Wismath, Stephen K ^b  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^b UNIVERSITY OF LETHBRIDGE   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 30244523583     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/0925-7721(95)00017-8     Document Type: Article

References (20)

1. A. Aho, J. Hopcroft and J. Ullman, The Design and Analysis of Algorithms (Addison-Wesley, Reading, MA, 1974).
2. T. Andreae, Some results on visibility graphs, Discrete Appl. Math. 40(1) (1992) 5-18.
3. P. Duchet, Y. Hamidoune, M. Las Vergnas and H. Meyniel, Representing a planar graph by vertical lines joining different levels, Discrete Math. 46 (1983) 319-321.
4. H. Everett, Visibility graph recognition, Ph.D. Thesis, University of Toronto, January, 1990.
5. H. Everett and D. Corneil, Recognizing visibility graphs of spiral polygons, J. Algorithms 11 (1990) 1-26.
6. S. Foldes, Sequential separability of directional convex objects with restricted motion, GERAD technical report, G-89-21, 1989.
7. M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (W.H. Freeman and Co., 1979).
8. M. Garey, D. Johnson and H. So, An application of graph coloring to printed circuit testing, IEEE Trans. Circuits Syst. 23 (1976) 591-598.
9. S. Ghosh, On recognizing and characterizing visibility graphs of simple polygons, The Johns Hopkins University/EECS Technical Report 86/14, 1986.
10. D.G. Kirkpatrick, Establishing order in planar subdivisions, Discrete Comput. Geom. 3 (1988) 267-280.
11. D.G. Kirkpatrick and S.K. Wismath, Determining bar-representability for unordered graphs, manuscript, 1991.
12. F. Luccio, S. Mazzone and C.K. Wong, A note on visibility graphs, Discrete Math. 64 (1987) 209-219.
13. J. O'Rourke, Art Gallery Theorems and Algorithms (Oxford University Press, 1987).
14. F. Preparata and M.I. Shamos, Computational Geometry: An Introduction (Springer, Berlin, 1985).
15. I. Rival and J. Urrutia, Representing orders on the plane by translating convex figures, Order 4 (1988) 319-339.
16. P. Rosenstiehl and R. Tarjan, Rectilinear planar layouts and bipolar orientations of planar graphs, Discrete Comput. Geom. 1 (1986) 343-353.
17. M. Schlag, F. Luccio, P. Maestrini, D.T. Lee and C.K. Wong, A visibility problem in VLSI layout compaction, Advances in Computing Research 2, 259-282.
18. R. Tamassia and I. Tollis, A unified approach to visibility representations of planar graphs, Discrete Comput. Geom. 1 (1986) 321-341.
19. S.K. Wismath, Characterizing bar line-of-sight graphs, in: Proc. 1st ACM Symp. Comput. Geom., Baltimore (1985) 147-152.
20. S.K. Wismath, Bar-representable visibility graphs and a related network flow problem, Ph.D. Thesis, University of British Columbia, 1989.