211 search results - page 1 / 43 » Counting the number of independent sets in chordal graphs |
JDA
2008
13 years 4 months ago
2008
WG
2005
Springer
13 years 10 months ago
2005
Springer
WG
2009
Springer
13 years 11 months ago
2009
Springer
FSTTCS
2010
Springer
13 years 2 months ago
2010
Springer
ABSTRACT. The maximum independent set problem (MAXIS) on general graphs is known to be NPhard to approximate within a factor of n1-, for any > 0. However, there are many "...
ANOR
2005
13 years 4 months ago
2005
In Hell et al. (2004), we have previously observed that, in a chordal graph G, the maximum number of independent r-cliques (i.e., of vertex disjoint subgraphs of G, each isomorphic...