Results 1 
3 of
3
by
, 2012
"... (Abstract) Counting the number of paths in a graph, for example the number of nonintersecting (or selfavoiding) rook paths joining opposite corners of an n × n grid, is not an easy problem since no mathematical formula is found and the number becomes too large to enumerate one by one except for sma ..."
Abstract
 Add to MetaCart
(Abstract) Counting the number of paths in a graph, for example the number of nonintersecting (or selfavoiding) rook paths joining opposite corners of an n × n grid, is not an easy problem since no mathematical formula is found and the number becomes too large to enumerate one by one except for small graphs. We have implemented software based on the ZDD technique in Knuth’s “The Art of Computer Programming ” carefully so as to achieve better memory efficiency, and have succeeded in computing the exact numbers for some graphs that were not known until now. 1
Efficient TopDown ZDD Construction Techniques Using Recursive Specifications
, 2013
"... Many important problems of graph enumeration and indexing can be solved by frontierbased methods, which construct ZDDs in a breadthfirst manner from the top to the bottom. We present new techniques toward an efficient framework to deal with the frontierbased methods. Ad hoc parts of the algorithm ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Many important problems of graph enumeration and indexing can be solved by frontierbased methods, which construct ZDDs in a breadthfirst manner from the top to the bottom. We present new techniques toward an efficient framework to deal with the frontierbased methods. Ad hoc parts