3267 search results - page 278 / 654 » Generalized quasirandom graphs |
208
click to vote
ICCAD
1999
IEEE
15 years 11 months ago
1999
IEEE
In this paper we present new methods for fast justification and propagation in the implication graph (IG) which is the core data structure of our SAT based implication engine. As ...
153
click to vote
UIST
1997
ACM
15 years 11 months ago
1997
ACM
The GLIDE system is an interactive constraint-based editor for drawing small- and medium-sized graphs (50 nodes or fewer) that organizes the interaction in a more collaborative ma...
157
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
abstract such additional information as network annotations. We introduce a network topology modeling framework that treats annotations as an extended correlation profile of a net...
172
click to vote
CPC
2007
15 years 6 months ago
2007
Let G be a graph with no three independent vertices. How many edges of G can be packed with edge-disjoint copies of Kk? More specifically, let fk(n, m) be the largest integer t s...
158
click to vote
JCO
2010
15 years 5 months ago
2010
Given a network G = (V, E), we say that a subset of vertices S ⊆ V has radius r if it is spanned by a tree of depth at most r. We are interested in determining whether G has a cu...