2 search results - page 1 / 1 » Ear Decompositions of Matching Covered Graphs |
71
Voted
COMBINATORICA
1999
15 years 2 months ago
1999
ESA
2009
Springer
15 years 9 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...