Reverse search for enumeration

Discrete Applied Mathematics

Volumn 65, Issue 1-3, 1996, Pages 21-46

  Avis, David ^a   Fukuda, Komei ^b,c  

^a MCGILL UNIVERSITY   (Canada)

^b UNIVERSITY OF TSUKUBA   (Japan)

^c FUJITSU LABORATORIES LTD   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001194185     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0166-218X(95)00026-N     Document Type: Article

References (23)

1. A.V. Aho, J.E. Hopcroft and J.D. Ullman, Data Structures and Algorithms (Addison-Wesley, Reading, MA, 1987).
2. D. Avis, A C implementation of the reverse search vertex enumeration algorithm, Research Report RIMS Kokyuroku 872, Kyoto University (1994).
3. D. Avis and V. Chvátal, Notes on Bland's pivoting rule, Math. Programming 8 (1978) 24-34.
4. D. Avis and K. Fukuda, A basis enumeration algorithm for linear systems with geometric applications, Appl. Math. Lett. 5 (1991) 39-42.
5. D. Avis and K. Fukuda, A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra, Discrete Comput. Geom. 8 (1992) 295-313.
6. R.C. Buck, Partion of space, Amer. Math. Monthly 50 (1943) 541-544.
7. H. Edelsbrunner, Algorithms in Combinatorial Geometry (Springer, Berlin, 1987).
8. S. Fortune, A note on Delaunay diagonal flips, AT&T Bell Laboratories, Murray Hill, NJ (1987).
9. S. Fujishige, Submodular Functions and Optimization, Annals of Discrete Mathematics 47 (North-Holland, Amsterdam, 1991).
10. K. Fukuda and I. Mizukoshi, Mathematica package: Vertex enumeration for convex polyhedra and hyperplane arrangements, Version 0.3 Beta, Graduate School of Systems Management, University of Tsukuba, Tokyo (1991), available via anonymous ftp from cs.sunysb.edu (directory pub/Combinatorica).
11. K. Fukuda, K. Saito and A. Tamura, Combinatorical face enumeration in arrangements and oriented matroids, Discrete Appl. Math. 31 (1991) 141-149.
12. K. Fukuda, K. Saito, A. Tamura and T. Tokuyama Bounding the number of k-faces in arrangements of hyperplanes, Discrete Appl. Math. 31 (1991) 151-165.
13. L.J. Guibas and J. Stolfi, Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams, ACM Trans. Graphics 4 (1985) 74-123.
14. D.E. Knuth and J.L. Szwarcfiter, A structured program to generate all topological sorting arrangements, Inform. Process. Lett. 2 (1974) 153-157.
15. T. Matsui, Algorithms for finding all the spanning trees in undirected graphs, METR93-08, Department of Mathematical Engineering and Information Physics, Faculty of Engineering, University of Tokyo (1993).
16. C.H. Papadimitriou and K. Steiglitz, Combinatorial Optimization (Printice-Hall, Englewood Cliffs, NJ, 1982).
17. G. Pruesse and F. Ruskey, Generating linear extensions fast, SIAM J. Comput., to appear.
18. R.C Read and R.E. Tarjan, Bounds on backtrack algorithms for listing cycles, paths, and spanning trees, Networks 5 (1975) 237-252.
19. A. Schrijver, Theory of Linear and Integer Programming (Wiley, New York, 1986).
20. A. Shioura and A. Tamura, Efficiently scanning all spanning trees of an undirected graph, J. Oper. Res. Soc. Japan 38 (1995).
21. H. Telley, Static and dynamic weighted Delaunay triangulations in the Euclidean plane and in the flat torus, Research Report No. UIUCDCS-R-90-1662, Department of Computer Science, University of Illinois at Urbana-Champaign (1990).
22. D.J.A. Welsh, Matroid Theory (Academic Press, New York, 1976).
23. F.F. Yao, On the priority approach to hidden surface algorithms, in: Proceedings 21st Symposium on Foundations of Computer Science (1980) 301-307.