871 search results - page 158 / 175 » The vertex-cover polynomial of a graph |
BROADNETS
2006
IEEE
15 years 3 months ago
2006
IEEE
— We introduce a new algorithmic framework for advanced channel reservation in ultra high speed networks, called Graded Channel Reservation (GCR). GCR allows users to specify min...
79
Voted
IPPS
2006
IEEE
15 years 3 months ago
2006
IEEE
Users and developers of grid applications have access to increasing numbers of resources. While more resources generally mean higher capabilities for an application, they also rai...
ASM
2005
ASM
15 years 3 months ago
2005
ASM
lation of BGS model of Abstract State Machines Comandur Seshadhri1 , Anil Seth2 , and Somenath Biswas2 1 Department of Computer Science Princeton University, Princeton NJ 08544, US...
105
click to vote
ESA
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Traditional shortest path problems play a central role in both the design and use of communication networks and have been studied extensively. In this work, we consider a...
111
click to vote
FCT
2005
Springer
15 years 3 months ago
2005
Springer
We present several results on the complexity of various forms of Sperner’s Lemma in the black-box model of computing. We give a deterministic algorithm for Sperner problems over ...