2 search results - page 1 / 1 » Ear Decompositions of Matching Covered Graphs |
COMBINATORICA
1999
13 years 5 months ago
1999
ESA
2009
Springer
14 years 10 days 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...