2911 search results - page 326 / 583 » A Logic of Graph Constraints |
170
click to vote
ANOR
2005
15 years 6 months ago
2005
In Hell et al. (2004), we have previously observed that, in a chordal graph G, the maximum number of independent r-cliques (i.e., of vertex disjoint subgraphs of G, each isomorphic...
197
click to vote
INFOCOM
2010
IEEE
15 years 5 months ago
2010
IEEE
—Efficient operation of wireless networks and switches requires using simple (and in some cases distributed) scheduling algorithms. In general, simple greedy algorithms (known a...
173
click to vote
SIGMOD
2010
ACM
15 years 11 months ago
2010
ACM
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often i...
178
click to vote
ICCAD
1999
IEEE
15 years 11 months ago
1999
IEEE
This paper presents a new method to synthesize timed asynchronous circuits directly from the specification without generating a state graph. The synthesis procedure begins with a ...
180
click to vote
JPDC
2007
15 years 6 months ago
2007
Object space (OS) parallelization of an efficient direct volume rendering algorithm for unstructured grids on distributed-memory architectures is investigated. The adaptive OS de...