97 search results - page 18 / 20 » Cycles, Paths, Connectivity and Diameter in Distance Graphs |
SNPD
2007
15 years 2 months ago
2007
In this paper, we propose a new class of interconnection networks, called “biswapped networks” (BSNs). Each BSN is built of 2n copies of some n-node basis network using a simp...
FOCS
2003
IEEE
15 years 6 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...
ICALP
2010
Springer
15 years 6 months ago
2010
Springer
We consider the problem of efficiently finding an additive C-spanner of an undirected unweighted graph G, that is, a subgraph H so that for all pairs of vertices u, v, δH (u, v) ...
AGILE
2009
Springer
15 years 8 months ago
2009
Springer
We study a point pattern detection problem on networks, motivated by geographical analysis tasks, such as crime hotspot detection. Given a network N (for example, a street, train,...
110
click to vote
JOIN
2007
15 years 1 months ago
2007
This paper is devoted to the following incremental problem. Initially, a graph and a distinguished subset of vertices, called initial group, are given. This group is connected by ...