3267 search results - page 129 / 654 » Generalized quasirandom graphs |
DATE
2008
IEEE
15 years 5 months ago
2008
IEEE
In this paper, we use the generalized binary de Bruijn (GBDB) graph as a scalable and efficient network topology for an on-chip communication network. Using just two-layer wiring,...
108
click to vote
CIE
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generaliz...
EPIA
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. In social network analysis, a k-clique is a relaxed clique, i.e., a kclique is a quasi-complete sub-graph. A k-clique in a graph is a sub-graph where the distance between...
HT
2009
ACM
15 years 5 months ago
2009
ACM
This paper describes the Scalable Hyperlink Store, a distributed in-memory “database” for storing large portions of the web graph. SHS is an enabler for research on structural...
ISSS
1997
IEEE
15 years 3 months ago
1997
IEEE
Integer Linear Programming ILP is commonly used in high level and system level synthesis. It is an NP-Complete problem in general cases . There exists some tools that give an o...