4865 search results - page 622 / 973 » The Complexity of Graph Connectivity |
300
click to vote
SIGMOD
2009
ACM
16 years 7 months ago
2009
ACM
Keyword search in relational databases (RDBs) has been extensively studied recently. A keyword search (or a keyword query) in RDBs is specified by a set of keywords to explore the...
219
click to vote
IMC
2009
ACM
16 years 1 months ago
2009
ACM
Understanding how users behave when they connect to social networking sites creates opportunities for better interface design, richer studies of social interactions, and improved ...
215
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...
172
click to vote
INFOCOM
2007
IEEE
16 years 1 months ago
2007
IEEE
— Existing work on placing additional relay nodes in wireless sensor networks to improve network connectivity typically assumes homogeneous wireless sensor nodes with an identica...
193
click to vote
DSN
2006
IEEE
16 years 25 days ago
2006
IEEE
This paper considers the eventual leader election problem in asynchronous message-passing systems where an arbitrary number t of processes can crash (t < n, where n is the tota...