803 search results - page 24 / 161 » Independence in Direct-Product Graphs |
SPAA
2005
ACM
14 years 29 days ago
2005
ACM
A weighted undirected network is ∆ growth-bounded if the number of nodes at distance 2r around any given node is at most ∆ times the number of nodes at distance r around the n...
SODA
2004
ACM
13 years 8 months ago
2004
ACM
We describe a machine model for automatically dynamizing static algorithms and apply it to historyindependent data structures. Static programs expressed in this model are dynamize...
COMBINATORICS
2004
13 years 7 months ago
2004
A graph G is well-covered if every maximal independent set has the same cardinality. Let sk denote the number of independent sets of cardinality k, and define the independence pol...
JAL
2000
13 years 7 months ago
2000
Random independent sets in graphs arise, for example, in statistical physics, in the hard-core model of a gas. In 1997, Luby and Vigoda described a rapidly mixing Markov chain for...
UAI
2008
13 years 8 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...