3008 search results - page 75 / 602 » Independence in connected graphs |
67
Voted
DM
2008
15 years 27 days ago
2008
For a positive integer k and a graph G, the k-colour graph of G, Ck(G), is the graph that has the proper k-vertex-colourings of G as its vertex set, and two k-colourings are joine...
118
Voted
UAI
2008
15 years 2 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...
89
Voted
DM
1998
15 years 15 days ago
1998
In this paper a polynomial algorithm for the prime factorization of finite, connected nonbipartite graphs with respect to the cardinal product is presented. This algorithm also d...
103
Voted
JUCS
2007
15 years 21 days ago
2007
: For modeling real-life situations where not only the intensity of the relation existing between elements but also its polarity is important, we have proposed (see [Marcus and Tat...
118
click to vote
FOCS
2009
IEEE
15 years 7 months ago
2009
IEEE
Abstract— We give approximation algorithms for the Generalized Steiner Network (GSN) problem. The input consists of a graph