P. Flajolet, B. Salvy, Computer Algebra Libraries for Combinatorial Structures, J. Symbolic Computation, 20 (1995) 653-671. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Growth in Products of Graphs - Pisanski, Tucker (2001) (Correct)
....is on the actual computation of generating functions for various operations on graphs, where we try to express the growth series of various products in terms of growth series of their factors. Many of these operations can be carried our completely automatically, as shown by Flajolet and Salvy [6]. All graphs in this paper are simplicial and connected, unless speci ed otherwise. In Section 2 we de ne two di erent growth functions: the sphere growth and the ball growth. Although they are related, we nd the spherical growth function easier to compute for most products. The only exception ....
P. Flajolet, B. Salvy, Computer Algebra Libraries for Combinatorial Structures, J. Symbolic Computation, 20 (1995) 653-671.
Philippe Flajolet's Research In Analysis Of Algorithms.. - Prodinger, Szpankowski (1998) (Correct)
No context found.
P. Flajolet and B. Salvy. Computer algebra libraries for combinatorial structures. Journal of Symbolic Computation, 20:653--671, 1995.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC