15 search results - page 1 / 3 » Linear-Time Counting Algorithms for Independent Sets in Chor... |
WG
2005
Springer
13 years 10 months ago
2005
Springer
JDA
2008
13 years 4 months ago
2008
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 "...
DAM
1999
13 years 4 months ago
1999
The definitions of four previously studied parameters related to total coverings and total matchings of graphs can be restricted, thereby obtaining eight parameters related to cov...
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...