3268 search results - page 385 / 654 » The hub number of a graph |
164
click to vote
ICPADS
2005
IEEE
16 years 6 days ago
2005
IEEE
Peer-to-Peer (P2P) applications typically use overlay networks to forward the content queries. However, due to the distributed fashion of the overlay establishment, the overlay ne...
182
click to vote
EDCC
2005
Springer
16 years 4 days ago
2005
Springer
Many governmental agencies and businesses organizations use networked systems to provide a number of services. Such a service-oriented network can be implemented as an overlay on ...
170
click to vote
EUROPAR
2004
Springer
16 years 12 hour ago
2004
Springer
Computing a spanning tree and the connected components of a graph are basic problems in Graph Theory and arise as subproblems in many applications. Dehne et al. present a BSP/CGM a...
145
click to vote
FOCS
2003
IEEE
15 years 12 months ago
2003
IEEE
We initiate a general study of pseudo-random implementations of huge random objects, and apply it to a few areas in which random objects occur naturally. For example, a random obj...
220
click to vote
PODS
2010
ACM
15 years 11 months ago
2010
ACM
For many problems arising in the setting of graph querying (such as finding semantic associations in RDF graphs, exact and approximate pattern matching, sequence alignment, etc.)...