241 search results - page 17 / 49 » Graphs, Hypergraphs and Hashing |
111
Voted
JPDC
2000
15 years 1 months ago
2000
A new class of interconnection networks, the hypernetworks, has been proposed recently. Hypernetworks are characterized by hypergraphs. Compared with point-to-point networks, they...
108
Voted
DAM
2010
15 years 1 months ago
2010
We study P6-free graphs, i.e., graphs that do not contain an induced path on six vertices. Our main result is a new characterization of this graph class: a graph G is P6-free if an...
91
Voted
IS
2008
15 years 1 months ago
2008
In spatial networks, clustering adjacent data to disk pages is highly likely to reduce the number of disk page accesses made by the aggregate network operations during query proce...
108
click to vote
EJC
2006
15 years 1 months ago
2006
The small subgraph conditioning method first appeared when Robinson and the second author showed the almost sure hamiltonicity of random d-regular graphs. Since then it has been u...
CONCUR
2001
Springer
15 years 6 months ago
2001
Springer
In this paper we introduce a static analysis technique for graph transformation systems. We present an algorithm which, given a graph transformation system and a start graph, produ...