2430 search results - page 326 / 486 » Computing Tutte Polynomials |
134
Voted
ESA
2004
Springer
15 years 9 months ago
2004
Springer
Edge contraction is shown to be a useful mechanism to improve lower bound heuristics for treewidth. A successful lower bound for treewidth is the degeneracy: the maximum over all ...
137
Voted
DIALM
2003
ACM
15 years 9 months ago
2003
ACM
We consider the problem of maximizing the lifetime of a given multicast connection in a wireless network of energyconstrained (e.g. battery-operated) nodes, by choosing ideal tran...
148
Voted
MOBICOM
2003
ACM
15 years 9 months ago
2003
ACM
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...
128
Voted
BICOB
2010
Springer
15 years 8 months ago
2010
Springer
In this paper we investigate the structure and representation of n-ary algebras arising from DNA recombination, where n is a number of DNA segments participating in recombination. ...
152
Voted
TAMC
2009
Springer
15 years 8 months ago
2009
Springer
Given a universal constant k, the multiple Stack Travelling Salesman Problem (kSTSP in short) consists in finding a pickup tour T1 and a delivery tour T2 of n items on two distinc...