Combinatorial and geometric approaches to counting problems on linear matroids, graphic arrangements, and partial orders

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1090, Issue , 1996, Pages 68-80

  Imai, Hiroshi ^a   Iwata, Satoru ^b   Sekine, Kyoko ^a   Yoshida, Kensyu ^a  

^a UNIVERSITY OF TOKYO   (Japan)

^b KYOTO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY DECISION DIAGRAMS; BOOLEAN FUNCTIONS; COMPUTATIONAL GEOMETRY; SET THEORY;

ACYCLIC ORIENTATION; CONSTRUCTION ALGORITHMS; COUNTING PROBLEMS; FOLLOWING PROBLEM; GEOMETRIC APPROACHES; GEOMETRIC PROPERTIES; PARTIALLY ORDERED SET; TUTTE POLYNOMIAL;

COMBINATORIAL MATHEMATICS;

EID: 84929305619     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61332-3_140     Document Type: Conference Paper

References (17)

1. M. D. Atkinson and H. W. Chang: Computing the Number of Merging with Constraints. Information Processing Letters, Vol. 24 (1987), pp. 289-292.
2. D. Avis and K. Fukuda: A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra. Discrete and Computational Geometry, Vol. 8 (1992), pp. 295-313.
3. G. Brightwell and P. Winkler: Counting Linear Extensions is #P-Complete. Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991, pp. 175-181.
4. T. Brylawski and J. Oxley: The Tutte Polynomial and Its Applications. In "Ma-troid Applications" (N. White, ed.), Encyclopedia of Mathematics and Its Applications, Vol. 40 (1992), pp. 123-225.
5. M. Dyer, A. Frieze and R. Kannan: A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies. Journal of the Association for Computing Machinery, Vol. 38 (1991), pp. 1-17.
6. H. Edelsbrunner: Algorithms in Combinatorial Geometry. Springer-Verlag, Heidelberg, 1987.
7. C. Greene and T. Zaslavsky: On the Interpretation of Whitney Numbers Through Arrangements of Hyperplanes, Zonotopes, non-Radon partitions and Orientations of Graphs. Transactions of the American Mathematical Society, Vol. 280 (1983), pp. 97-126.
8. K. Hayase, K. Sadakane and S. Tani: Output-size Sensitiveness of OBDD Construction Through maximal Independent Set Problem. Proceedings of the Conference on Computing and Combinatorics (COCOON'95), Lecture Notes in Computer Science, Vol. 959 (1995), pp. 229-234.
9. H. Imai: Network-Flow Algorithms for Lower-Truncated Transversal Polyma-troids. Journal of the Operations Research Society of Japan, Vol. 26, No. 3 (1983), pp. 186-210.
10. L. Khachiyan: Complexity of Polytope Volume Computation. In "New Trends in Discrete and Computational Geometry" (J. Pach, ed.), Algorithms and Combinatorics, Vol. 10, Springer-Verlag, 1993, pp. 91-101.
11. J. Oxley: Matroid Theory. Oxford University Press, Oxford, 1992.
12. K. Sekine, H. Imai and S. Tani: Computing the Tutte Polynomial of a Graph of Moderate Size. Proceedings of the 5th International Symposium on Algorithms and Computation (ISAAC'95), Lecture Notes in Computer Science, to appear.
13. K. Sekine and H. Imai: A Unified Approach via BDD to the Network Reliability and Path Numbers. Technical Report, Department of Information Science, University of Tokyo, 1995.
14. P. D. Seymour: Matroid representation over GF(3), Journal of Combinatorial Theory, Ser. B, Vol. 26 (1979), pp. 159-173.
15. S. Tani and H. Imai: A Reordering Operation for an Ordered Binary Decision Diagram and an Extended Framework for Combinatorics of Graphs. Proceedings of the 5th International Symposium on Algorithms and Computation (ISAAC'94), Lecture Notes in Computer Science, Vol. 834 (1994), pp. 575-583.
16. D. J. A. Welsh: Matroid Theory. Academic Press, London, 1976.
17. D. J. A. Welsh: Complexity: Knots, Colourings and Counting. London Mathematical Society Lecture Note Series, Vol. 186, Cambridge University Press, 1993.