2503 search results - page 225 / 501 » A study of 3-arc graphs |
164
click to vote
DAM
2008
15 years 6 months ago
2008
We study the combinatorial problem of finding an arrangement of distinct integers into the ddimensional N-cube so that the maximal variance of the numbers on each -dimensional sec...
126
click to vote
JGT
2006
15 years 6 months ago
2006
We study the number F[n; k] of n-vertex graphs that can be written as the edgeunion of k-vertex cliques. We obtain reasonably tight estimates for F[n; k] in the cases (i) k = n-o(...
161
click to vote
CN
2000
15 years 6 months ago
2000
The study of the web as a graph is not only fascinating in its own right, but also yields valuable insight into web algorithms for crawling, searching and community discovery, and...
169
click to vote
FMCAD
2006
Springer
15 years 10 months ago
2006
Springer
Synchronous Data Flow Graphs (SDFGs) have proven to be suitable for specifying and analyzing streaming applications that run on single- or multi-processor platforms. Streaming appl...
161
click to vote
FOCS
2004
IEEE
15 years 10 months ago
2004
IEEE
We study a simple Markov chain, known as the Glauber dynamics, for generating a random k-coloring of a n-vertex graph with maximum degree . We prove that, for every > 0, the d...