THE COMPLEXITY OF VERTEX ENUMERATION METHODS

[1] Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st

[2] ALGORITHM FOR ENUMERATING ALL VERTICES OF A CONVEX POLYHEDRON [J]. COMPUTING, 1975, 15 (03) : 181 - 193

[3] ASSIGNMENT POLYTOPE [J]. SIAM REVIEW, 1974, 16 (04) : 516 - 525

[4] MINIMUM NUMBER OF VERTICES OF A SIMPLE POLYTOPE [J]. ISRAEL JOURNAL OF MATHEMATICS, 1971, 10 (01) : 121 - &

[5] SHELLABLE DECOMPOSITIONS OF CELLS AND SPHERES [J]. MATHEMATICA SCANDINAVICA, 1971, 29 (02) : 197 - +

[6] GENERATING ALL FACES OF A POLYHEDRON [J]. SIAM JOURNAL ON APPLIED MATHEMATICS, 1974, 26 (03) : 479 - 489

[7] Chernikova N., 1965, COMP MATH MATH PHYS+, V5, P228

[8] ALGORITHM FOR DETERMINING ALL EXTREME POINTS OF A CONVEX POLYTOPE [J]. MATHEMATICAL PROGRAMMING, 1977, 12 (01) : 81 - 96

[9] ELIMINATING EXTRANEOUS EDGES IN GREENBERG ALGORITHM [J]. MATHEMATICAL PROGRAMMING, 1980, 19 (01) : 106 - 110

[10] DYER ME, 1979, 10TH S MATH PROGR MO

[1] Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st

[2] ALGORITHM FOR ENUMERATING ALL VERTICES OF A CONVEX POLYHEDRON [J]. COMPUTING, 1975, 15 (03) : 181 - 193

[3] ASSIGNMENT POLYTOPE [J]. SIAM REVIEW, 1974, 16 (04) : 516 - 525

[4] MINIMUM NUMBER OF VERTICES OF A SIMPLE POLYTOPE [J]. ISRAEL JOURNAL OF MATHEMATICS, 1971, 10 (01) : 121 - &

[5] SHELLABLE DECOMPOSITIONS OF CELLS AND SPHERES [J]. MATHEMATICA SCANDINAVICA, 1971, 29 (02) : 197 - +

[6] GENERATING ALL FACES OF A POLYHEDRON [J]. SIAM JOURNAL ON APPLIED MATHEMATICS, 1974, 26 (03) : 479 - 489

[7] Chernikova N., 1965, COMP MATH MATH PHYS+, V5, P228

[8] ALGORITHM FOR DETERMINING ALL EXTREME POINTS OF A CONVEX POLYTOPE [J]. MATHEMATICAL PROGRAMMING, 1977, 12 (01) : 81 - 96

[9] ELIMINATING EXTRANEOUS EDGES IN GREENBERG ALGORITHM [J]. MATHEMATICAL PROGRAMMING, 1980, 19 (01) : 106 - 110

[10] DYER ME, 1979, 10TH S MATH PROGR MO