4679 search results - page 12 / 936 » Modeling When Connections Are the Problem |
124
click to vote
AGP
2010
IEEE
15 years 1 months ago
2010
IEEE
This chapter tackles the relation between declarative languages and multi-agent systems by following the dictates of the five Ws (and one H) that characterize investigations. The ...
106
click to vote
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
Dynamic connectivity is a well-studied problem, but so far the most compelling progress has been confined to the edge-update model: maintain an understanding of connectivity in a...
MFCS
1992
Springer
15 years 1 months ago
1992
Springer
In this paper we survey the major developments in understanding the complexity of the graph connectivity problem in several computational models, and highlight some challenging op...
CORR
2010
Springer
14 years 8 months ago
2010
Springer
Abstract Consider a random graph model where each possible edge e is present independently with some probability pe. Given these probabilities, we want to build a large/heavy match...
ICALP
2004
Springer
15 years 3 months ago
2004
Springer
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...