Counting the number of paths in a graph via BDDs

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E80-A, Issue 4, 1997, Pages 682-688

  Sekine, Kyoko ^a   Imai, Hiroshi ^a  

^a UNIVERSITY OF TOKYO   (Japan)

Author keywords

p complete; BDD; Graphs; Paths

Indexed keywords

ALGORITHMS; BINARY SEQUENCES; DECISION TABLES; EFFICIENCY;

PATH NUMBER COUNTING;

GRAPH THEORY;

EID: 0031117195     PISSN: 09168508     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (20)

1. N. Alon, P. Seymour, and R. Thomas, A separator theorem for graphs with an excluded minor and its applications, Proc. of the 22nd Annual ACM Symp. on Theory of Computing, pp.293-299, 1990.
2. E.T. Bax, Algorithms to count paths and cycles, Infor. Process. Lett., vol.52, pp.249-252, 1994.
3. E. Biondi, L. Divieti, and G. Guardabassi, Counting paths, circuits, chains, and cycles in graphs: a unified approach, Canad. J. Math., vol.22, pp.22-35, 1970.
4. A. Björner and G.M. Ziegler, Introduction to Greedoids, in Matroid Applications, ed. N. White, Encyclopedia of Mathematics and Its Applications, vol.26, pp.284-357, Cambridge University Press, 1992.
5. R.E. Bryant, Graph-based algorithms for Boolean function manipulation, IEEE Trans. Comput., vol.C-35, pp.677-691, 1986.
6. C.J. Colbourn, The Combinatorics of Network Reliability, Oxford University Press, 1987.
7. O. Coudert and J. Madre, Implicit and incremental computation of primes and essential primes of Boolean functions, Proc. 29th ACM/IEEE DAC, pp.36-39, 1992.
8. D. Eppstein, Finding the k shortest paths, Proc. of the 25th Annual IEEE Symp. on Foundations of Computer Science, pp.154-165, 1994.
9. D.D. Harms, M. Kraetzl, C.J. Colbourn, and J.S. Devitt, Network Reliability: Experiments with a Symbolic Algebra Environment, CRC Press, Inc., 1995.
10. K. Hayase and H. Imai, OBDDs of a monotone function and of its prime implicants, ISAAC'96, Lecture Notes in Computer Science, vol.1178, pp.136-145, Springer-Verlag, 1996.
11. B. Korte, L. Lovász, and R. Schrader, Greedoids, Algorithms and Combinatorics, vol.4, Springer-Verlag, 1991.
12. R.J. Lipton, D.J. Rose, and R.E. Tarjan, Generalized nested dissection, SIAM J. Numer. Anal., vol.16, no.2, pp.346-358, 1979.
13. R.J. Lipton and R.E. Tarjan, A separator theorem for planar graphs, SIAM J. on Appl. Math., vol.36, no.2, pp.177-189, 1979.
14. L. Lovász, Combinatorial Problems and Exercises, North-Holland, Amsterdam-New York, 1979; 2nd edition, 1993.
15. J.S. Provan, The complexity of reliability computations in planar and acyclic graphs, SIAM J. Comput., vol.15, no.3, pp.694-702, 1986.
16. K. Sekine, H. Imai, and S. Tani, Computing the Tutte polynomial of a graph of moderate size, ISAAC'95, Lecture Notes in Computer Science, vol.1004, pp.224-233, Springer-Verlag, 1995.
17. S. Tani, An Extended Framework of Ordered Binary Decision Diagrams for Combinatorial Graph Problems, Master's Thesis, University of Tokyo, 1995.
18. S. Tani and H. Imai, A reordering operation for an ordered binary decision diagram and an extended framework for combinatorics of graphs, ISAAC'94, Lecture Notes in Computer Science, vol.834, pp.575-583, Springer-Verlag, 1994.
19. L.G. Valiant, The complexity of enumeration and reliability problems, SIAM J. Comput., vol.8, no.3, pp.410-421, 1979.
20. D.J.A. Welsh, Complexity: Knots, Colourings and Counting, London Mathematical Society Lecture Note Series, vol.186, Cambridge University Press, 1993.