211 search results - page 3 / 43 » Counting the number of independent sets in chordal graphs |
FOCS
1999
IEEE
13 years 12 months ago
1999
IEEE
CC
2000
Springer
13 years 7 months ago
2000
Springer
CANDC
2005
ACM
13 years 7 months ago
2005
ACM
We introduce a new family of metrics for graphs of fixed size, based on counting-independent sets. Our definition is simpler and easier to e than the edge ideal metric family defi...
DAM
1999
13 years 7 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...
PARA
2004
Springer
14 years 27 days ago
2004
Springer
This paper gives a numerical algorithm able to compute the number of path-connected components of a set S defined by nonlinear inequalities. This algorithm uses interval analysis ...