Computing the invariant polynomials of graphs networks and matroids

IEICE Transactions on Information and Systems

Volumn E83-D, Issue 3, 2000, Pages 330-343

  Imai, Hiroshi ^a  

^a UNIVERSITY OF TOKYO   (Japan)

Author keywords

BDD; Matroid; Network reliability; Simplicial complex; Tutte polynomial

Indexed keywords

BINARY SEQUENCES; COMPUTER NETWORKS; DECISION THEORY; GRAPH THEORY; MATRIX ALGEBRA; POLYNOMIALS; RELIABILITY;

BINARY DECISION DIAGRAMS; INVARIANT POLYNOMIALS; JONES POLYNOMIAL; TUTTE POLYNOMIAL;

COMPUTATIONAL COMPLEXITY;

EID: 0034156841     PISSN: 09168532     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (36)

1. N. Alon A. Frieze and D. Welsh "Polynomial time randomized approximation schemes for Tutte-Grothendieck invariants: The dense case" Random Structures Algorithms vol.6 no.4 pp.459-478 1995.
2. J.D. Annan The Complexity of Counting Problems Ph.D. Thesis University of Oxford 1994.
3. D. Avis and K. Fukuda "A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra" Discrete and Computational Geometry vol.8 pp.295313 1992.
4. M.O. Ball and J.S. Provan ''Calculating bounds on reachability and connectedness in stochastic networks" Networks vol.13 pp.253-278 1983.
5. A. Björner ''The homology and shellability of matroids and geometric lattices" in Matroid Applications ed. N. White pp.226-283 Cambridge Univ. Press 1992. [G] B. Bollobds Random Graphs Academic Press 1985. [7] R.E. Bryant "Graph based algorithms for Boolean function manipulation" IEEE Trans. Comput. vol.C-35 pp.677691 1986.
6. T. Brylawski and J. Oxley "The tutte polynomial and its applications" in Matroid Applications cd. N. White pp. 123-225 Cambridge University Press 1992.
7. C.J.-.Colbourn The Combinatorics of Network Reliability Oxford University Press 1987.
8. H. Edelsbrunner Algorithms in Combinatorial Geometry Springer-Verlag Heidelberg 1987.
9. C. Greene and T. Zaslavsky "On the interpretation of Whitney numbers through arrangements of hyperplanes zonotopes non-Radon partitions and orientations of graphs" Trans. AMS vol.280 pp.97-126 1983.
10. D.D. Harms M. Kraetzl C.J. Colbourn and J.S. Devitt Network Reliability: Experiments with a Symbolic Algebra Environment CRC Press Inc. 1995.
11. K. Hayase and H. Imai "OBDDs of a monotone function and of its prime implicants" Theory of Computing Systems vol.31 pp.579-591 1998.
12. K. Hayase K. Sadakane and S. Tani "Output-size sensitiveness of OBDD construction through maximal independent set problem" Lecture Notes in Computer Science vol.959 pp.229-234 1995.
13. H. Imâi "Network reliability computation and related issues - New trends in combinatorial enumeration/counting" in Discrete Structures and Algorithms V ed. S. Fujishige pp. 1-50 Kindai-Kagaku-sha 1998.
14. H. Imai K. Sekine and K. Imai "Computational investigations of all-terminal network reliability via BDDs" IEICE Trans. Fundamentals vol.E82-A no.5 pp.714-721 May 1999.
15. H. Imai S. Iwata K. Sekine and K. Yoshida "Combinatorial and geometric approaches to counting problems on linear matroids graphic arrangements and partial orders" Lecture Notes in Computer Science vol.1090 pp.68-80 Springer-Verlag 199G.
16. D.R. Karger "A randomized fully polynomial time approximation scheme for the all terminal network reliability problem" Proc. 27th Annual ACM Symp. on Theory of Computing pp.11-17 1995.
17. D. Karger and R.P. Tai "Implementing a fully polynomial time approximation scheme for all terminal network relia-
18. bility" Proc. SIAM-ACM Symp. on Discrete Algorithms pp.334-343 1997.
19. R.J. Lipton and R.E. Tarjan "A separator theorem for planar graphs" SIAM J. on Appl. Math. vol.30 no.2 pp.177189 1979.
20. Ch. Meinel and T. Theobald Algorithms and Data Structures in VLSI Design: OBDD - Foundations and Applications Springer-Verlag Heidelberg 1998.
21. S.-I. Minato Binary Decision Diagrams and Applications for VLSI CAD Kluwer Academic 1996. Reliability vol.41 no.2 pp.225-229 1992.
22. J. Oxley Matroid Theory Oxford University Press Oxford 1992.
23. J.S. Provan '"The complexity of reliability computations in planar and acyclic graphs" SIAM J. Comput. vol.15 no.3 pp.694-702 1986.
24. K. Sadakane K. Hayase and H. Imai "A parallel top-down algorithm to construct binary decision diagrams" IPSJ SIG Notes SIGAL-48-11 IPSJ 1995.
25. K. Sekine Algorithm for Computing the Tutte Polynomial and Its Applications Doctoral Thesis Department of Information Science University of Tokyo 1997.
26. K. Sekine and H. Imai "A unified approach via BDD to the network reliability and path numbers" Tech. Rep. 95-09 Department of Information Science University of Tokyo 1995.
27. K. Sekine and H. Imai "Counting the number of paths in a graph via BDDs" IEICE Trans. Fundamentals vol.E80-A no.4 pp.682-688 April 1997
28. K. Sekine and H. Imai "A mildly exponential algorithm for computing the Tutte polynomial of a graph" submitted 1999.
29. K. Sekine H. Imai and K. Imai "Computation of the Jones polynomial" Trans. JSIAM vol.8 no.3 pp.341-354 1998.
30. K. Sekine H. Imai and S. Tani "Computing the Tutte polynomial of a graph of moderate size" Lecture Notes in Computer Science vol.1004 pp.224-233 1995.
31. D.R. Shier Network Reliability and Algebraic Structures Oxford University Press 1991.
32. S. Tani and H. Imai "A reordering operation for an ordered binary decision diagram and an extended framework for combinatorics of graphs" Lecture Notes in Computer Science vol.834 pp.575-583 1994.
33. W.T. Tutte "A contribution to the theory of chromatic polynomials" Canadian J. Math. vol.6 pp.80-91 1954.
34. L.G. Valiant "The complexity of enumeration and reliability problems" SIAM J. Comput. vol.8 no.3 pp.410-421 1979.
35. D.J.A. Welsh Matroid Theory Academic Press London 1976.
36. D.J.A. Welsh Complexity: Knots Colourings and Counting Cambridge University Press 1993.