211 search results - page 20 / 43 » Counting the number of independent sets in chordal graphs |
ESA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. In this paper, we show that algorithms on tree decompositions can be made faster with the use of generalisations of fast subset convolution. Amongst others, this gives al...
IPPS
2007
IEEE
14 years 1 months ago
2007
IEEE
In message-passing parallel applications, messages are not delivered in a strict order. In most applications, the computation results and the set of messages produced during the e...
ESA
2004
Springer
14 years 1 months ago
2004
Springer
For planar graphs, counting the number of perfect matchings (and hence determining whether there exists a perfect matching) can be done in NC [4, 10]. For planar bipartite graphs, ...
WG
2010
Springer
13 years 6 months ago
2010
Springer
Θk-graphs are geometric graphs that appear in the context of graph navigation. The shortest-path metric of these graphs is known to approximate the Euclidean complete graph up to...
ACTA
2007
13 years 7 months ago
2007
Abstract We propose an exact algorithm for counting the models of propositional formulas in conjunctive normal form (CNF). Our algorithm is based on the detection of strong backdoo...