Sciweavers

139 search results - page 26 / 28
» Computing the Tutte Polynomial on Graphs of Bounded Clique-W...
Sort
View
FOCS
2004
IEEE
13 years 11 months ago
Tolls for Heterogeneous Selfish Users in Multicommodity Networks and Generalized Congestion Games
We prove the existence of tolls to induce multicommodity, heterogeneous network users that independently choose routes minimizing their own linear function of tolls versus latency...
Lisa Fleischer, Kamal Jain, Mohammad Mahdian
COCOON
2003
Springer
14 years 26 days ago
On a Conjecture on Wiener Indices in Combinatorial Chemistry
Drugs and other chemical compounds are often modeled as polygonal shapes, where each vertex represents an atom of the molecule, and covalent bonds between atoms are represented by...
Yih-En Andrew Ban, Sergei Bespamyatnikh, Nabil H. ...
TAMC
2010
Springer
14 years 21 days ago
Streaming Algorithms for Some Problems in Log-Space
Abstract. In this paper, we give streaming algorithms for some problems which are known to be in deterministic log-space, when the number of passes made on the input is unbounded. ...
Ajesh Babu, Nutan Limaye, Girish Varma
RECOMB
2005
Springer
14 years 8 months ago
Reconstruction of Reticulate Networks from Gene Trees
Abstract. One of the simplest evolutionary models has molecular sequences evolving from a common ancestor down a bifurcating phylogenetic tree, experiencing point-mutations along t...
Daniel H. Huson, Tobias H. Klöpper, Pete J. L...
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
14 years 8 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...