5473 search results - page 958 / 1095 » On the graph isomorphism problem |
184
click to vote
SOSP
2009
ACM
16 years 3 months ago
2009
ACM
This paper addresses the problem of scheduling concurrent jobs on clusters where application data is stored on the computing nodes. This setting, in which scheduling computations ...
186
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
—Broadcast is one of the most fundamental services in wireless sensor networks (WSNs). It facilitates sensor nodes to propagate messages across the whole network, serving a wide ...
185
click to vote
FSTTCS
2009
Springer
16 years 27 days ago
2009
Springer
A tournament T = (V, A) is a directed graph in which there is exactly one arc between every pair of distinct vertices. Given a digraph on n vertices and an integer parameter k, th...
167
click to vote
FOCS
2008
IEEE
16 years 24 days ago
2008
IEEE
In the Survivable Network Design Problem (SNDP) the goal is to find a minimum cost subset of edges that satisfies a given set of pairwise connectivity requirements among the ver...
167
click to vote
INFOCOM
2008
IEEE
16 years 23 days ago
2008
IEEE
—IEEE 802.11 WiFi equipment based wireless mesh networks have recently been proposed as an inexpensive approach to connect far-flung rural areas. Such networks are built using h...