2270 search results - page 107 / 454 » On the distribution of eigenvalues of graphs |
175
click to vote
EUROPAR
1998
Springer
15 years 10 months ago
1998
Springer
This paper illustrates the use of a post-mortem call-graph profiling tool in the analysis of an SQL query processing application written using BSPIib [4]. Unlike other parallel pro...
143
click to vote
WG
2009
Springer
16 years 27 days ago
2009
Springer
In this paper, we study the sub-coloring and hypo-coloring problems on interval graphs. These problems have applications in job scheduling and distributed computing and can be used...
154
click to vote
MOBIQUITOUS
2007
IEEE
16 years 18 days ago
2007
IEEE
—The skip graph, an application-layer data structure for routing and indexing, may be used in a sensor network to facilitate queries of the distributed k-dimensional data collect...
161
click to vote
APPROX
2004
Springer
15 years 11 months ago
2004
Springer
While it is exponentially unlikely that a sparse random graph or hypergraph is connected, with probability 1 − o(1) such a graph has a “giant component” that, given its numbe...
200
click to vote
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
With the development of highly efficient graph data collection technology in many application fields, classification of graph data emerges as an important topic in the data mining...