244 search results - page 23 / 49 » Intervalizing k-Colored Graphs |
134
Voted
PPOPP
2005
ACM
15 years 8 months ago
2005
ACM
We want to perform compile-time analysis of an SPMD program and place barriers in it to synchronize it correctly, minimizing the runtime cost of the synchronization. This is the b...
106
click to vote
WG
2007
Springer
15 years 8 months ago
2007
Springer
The pathwidth of a graph G is the minimum clique number of H minus one, over all interval supergraphs H of G. Although pathwidth is a well-known and well-studied graph parameter, t...
149
click to vote
ECCC
2007
15 years 2 months ago
2007
We study graph properties which are testable for bounded degree graphs in time independent of the input size. Our goal is to distinguish between graphs having a predetermined grap...
112
Voted
GC
2002
Springer
15 years 2 months ago
2002
Springer
We prove that for every c > 0 there exists a constant K = K(c) such that every graph G with n vertices and minimum degree at least cn contains a cycle of length t for every even...
106
Voted
RECOMB
2004
Springer
16 years 2 months ago
2004
Springer
The availability of large-scale protein-protein interaction data provides us with many opportunities to study molecular pathways involving proteins. In this paper we propose to mi...