109 search results - page 9 / 22 » Large independent sets in regular graphs of large girth |
DAM
2007
14 years 9 months ago
2007
The Fibonacci number of a graph is the number of independent vertex subsets. In this paper, we investigate trees with large Fibonacci number. In particular, we show that all trees...
UAI
2008
14 years 11 months ago
2008
We generalize Shimizu et al's (2006) ICA-based approach for discovering linear non-Gaussian acyclic (LiNGAM) Structural Equation Models (SEMs) from causally sufficient, conti...
158
click to vote
MLQ
2011
14 years 4 months ago
2011
Given a graph G whose set of vertices is a Polish space X, the weak Borel chromatic number of G is the least size of a family of pairwise disjoint G-independent Borel sets that cov...
CRYPTO
2012
Springer
13 years 2 days 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...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Estimating characteristics of large graphs via sampling is a vital part of the study of complex networks. Current sampling methods such as (independent) random vertex and random w...