|
|
A007803
|
|
Number of connected series-parallel graphs with a longest path of at most n edges and also a largest cut set of at most n edges.
|
|
0
|
|
|
|
OFFSET
|
1,2
|
|
REFERENCES
|
E. Detjens and G. Gannot, "Technology Mapping in MIS", Proc. 1987 IEEE Internat. Conf. Computer-Aided Design, pp. 166ff.
|
|
LINKS
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
michelb(AT)watson.ibm.com (Michel Berkelaar)
|
|
STATUS
|
approved
|
|
|
|