Last Modified : 2003-05-27

- H. Imai and K. Sekine: Computing of the Tutte Polynominal and Network Reliability, IEICE Technical Report CAS95-85, IEICE, 1995.
- H. Imai, K. Sekine, and K. Yoshida: Binary Decision Diagrams and Generating Functions of Sets Related to Graphs and Codes, in
*Proceedings of the 9th IEICE Karuizawa Workshop on Circuits and Systems*, pp. 91`-`96, 1996, IEICE. Paper(ps.gz) - K. Sekine: Tutte Polynominal, Flow Polynominal and Their Computation, in
*ISM Reports on Statistical Computing, ``Optimization: Modeling and Algorithms 7''*, Vol. 77, pp. 1`-`13, 1995, Institute of Statistical Mathematics. - K. Sekine: The Flow Polynomial and Its Computation, Master's thesis, University of Oxford, Apr. 1993, Submitted for the degree of M.Sc. by Research to the Faculty of Mathematical Sciences. Paper(dvi)
- K. Sekine and H. Imai: Computation of the Network Reliability, Technical Report. Abstract Paper(ps.gz)
- K. Sekine and H. Imai: Considerations Through Computational Experiments of Monte Carlo Methods and Exact Methods by BDDs for Network Reliability Computation, IPSJ SIG Notes 96-AL-54-4, IPSJ, 1996, (In Japanese). Paper(ps.gz)
- K. Sekine and H. Imai: Computation of the Tutte Polynominal and Network Reliability, IPSJ SIG Notes 95-AL-47-6, IPSJ, 1995.
- K. Sekine and H. Imai: A Unified Approach via BDD to the Network Reliability and Path Numbers, Technical Report 95-09, Department of Information Science, University of Tokyo, Nov. 1995. Abstract Paper(ps.gz) (revised May 15, 1996)
- K. Sekine, H. Imai, and S. Tani: Computing the Tutte Polynominal of a Graph of Moderate Size, in
*Proceedings of the 6th International Symposium on Algorithms and Computation (ISAAC'95)*, Lecture Notes in Computer Science, Vol. 1004, pp. 224`-`233, 1995. Paper(ps) - K. Sekine, H. Imai, and S. Tani: Computing the Tutte Polynomial of a Graph and the Jones Polynomial of an Alternating Link of Moderate Size, Technical Report 95-06, Department of Information Science, University of Tokyo, 1995. Paper(ps)
- K. Sekine, H. Imai, and S. Tani: Computing the Tutte Polynomial of a Graph and the Jones Polynomial of a Knot of Moderate Size, Technical Report. Abstract Paper(ps.gz)