2503 search results - page 71 / 501 » A study of 3-arc graphs |
164
click to vote
ISAAC
2003
Springer
15 years 11 months ago
2003
Springer
The Satisfactory Partition problem consists in deciding if a given graph has a partition of its vertex set into two nonempty sets V1, V2 such that for each vertex v, if v ∈ Vi th...
179
click to vote
RSA
2008
15 years 5 months ago
2008
We study the cover time of a random walk on the largest component of the random graph Gn,p. We determine its value up to a factor 1 + o(1) whenever np = c > 1, c = O(ln n). In ...
178
click to vote
IBERAMIA
2010
Springer
15 years 4 months ago
2010
Springer
We define a class of graphs that summarize in a compact visual way the interaction structure between binary multivariate characteristics. This allows studying the conditional depe...
155
click to vote
IEEEPACT
2003
IEEE
15 years 11 months ago
2003
IEEE
This paper presents a framework for analyzing the performance of multithreaded programs using a model called a constraint graph. We review previous constraint graph definitions fo...
189
click to vote
COMGEO
2011
ACM
15 years 1 months ago
2011
ACM
Let P be a set of n points in the plane. A geometric proximity graph on P is a graph where two points are connected by a straight-line segment if they satisfy some prescribed prox...