2430 search results - page 305 / 486 » Computing Tutte Polynomials |
134
Voted
DEDS
2010
15 years 3 months ago
2010
In discrete event systems, a given task can start executing when all the required input data are available. The required input data for a given task may change along the evolution...
122
Voted
AMC
2006
15 years 3 months ago
2006
``Church's thesis'' is at the foundation of computer science. We point out that with any particular set of physical laws, Church's thesis need not merely be po...
169
Voted
ENTCS
2006
15 years 3 months ago
2006
It is a well-known fact that algorithms are often hidden inside mathematical proofs. If these proofs are formalized inside a proof assistant, then a mechanism called extraction ca...
127
Voted
EOR
2006
15 years 3 months ago
2006
The subject of this paper is the formulation and solution of a variation of the classical binary knapsack problem. The variation that is addressed is termed the ``fixed-charge kna...
108
Voted
COMBINATORICS
2007
15 years 3 months ago
2007
We determine the exact and asymptotic number of unlabeled outerplanar graphs. The exact number gn of unlabeled outerplanar graphs on n vertices can be computed in polynomial time,...