3757 search results - page 171 / 752 » The overlap number of a graph |
177
click to vote
RSA
2000
15 years 6 months ago
2000
The creation and growth of components of a given complexity in a random graph process are studied. In particular, the expected number and total size of all such components is found...
156
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
Graph based semi-supervised learning (SSL) methods play an increasingly important role in practical machine learning systems. A crucial step in graph based SSL methods is the conv...
250
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...
245
click to vote
EDBT
2011
ACM
14 years 10 months ago
2011
ACM
Graph clustering has generally concerned itself with clustering undirected graphs; however the graphs from a number of important domains are essentially directed, e.g. networks of...
171
click to vote
CRYPTO
2012
Springer
13 years 8 months ago
2012
Springer
A secret-sharing scheme realizes a graph if every two vertices connected by an edge can reconstruct the secret while every independent set in the graph does not get any informatio...