H. L. Bodlaender and F. V. Fomin. Tree decompositions with small cost. In Proceedings 8th SWAT, Springer-Verlag LNCS 2368, pp. 378--387, 2002. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Experimental Evaluation of a Tree Decomposition Based.. - Alber, Dorn, Niedermeier (2002) (3 citations) (Correct)
....one appears to be a subset of the other. Both the distribution of the bagsizes and the number of bags have a direct influence on the running time of Phase II of the algorithm: Very recently, the notion of f cost was introduced as a more refined measure for the quality of a tree decomposition [12]. Here, f : N R is some function and the f cost of a tree decomposition is defined to be # i#I f( X i ) Since, in Phase II, the time (and space) needed to process a node of the tree decomposition whose associated bag has size k roughly is f(k) 2 the time needed for Phase ....
H. L. Bodlaender and F. V. Fomin. Tree decompositions with small cost. In Proceedings 8th SWAT 2002.
Tree Decompositions of Graphs: Saving Memory in Dynamic .. - Betzler, Niedermeier.. (2004) (Correct)
No context found.
H. L. Bodlaender and F. V. Fomin. Tree decompositions with small cost. In Proceedings 8th SWAT, Springer-Verlag LNCS 2368, pp. 378--387, 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC