D. Fern andez-Baca and G. Slutzki. Parametric problems on graphs of bounded tree-width. J. Algorithms, 16 (1994), 408--430. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Parametric and Kinetic Minimum Spanning Trees - Agarwal, Eppstein, Guibas.. (1998) (9 citations) (Correct)
....et al. 14] In that paper an algorithm was described that takes time O(mn log n) to list all trees. However this still remains far from Dey s bound of O(mn 1 3 ) on the number of such trees. Parametric optimization problems have been studied for several other graph problems as well; see [13, 28] for a sample of such results. There are no known previous algorithms for the kinetic minimum spanning tree problem. A related problem, which has been studied, is the kinetic Euclidean MST problem [4] in which we want to list all different Euclidean minimum spanning trees of a set of points, ....
D. Fern andez-Baca and G. Slutzki. Parametric problems on graphs of bounded tree-width. J. Algorithms, 16 (1994), 408--430.
Weighted Multidimensional Search and its Application.. - Agarwala.. (1993) (7 citations) (Correct)
....where H is a subgraph of G. The Lagrangian relaxation of problem (15) subject to the knapsack constraints, is Z P G ( optfVal G (H; H a subgraph of G satisfying Pg: 16) If property P is regular, there exists a O(n) time algorithm to compute Z P G ( for any fixed . Also, as proved in [FeSl92], there exists a O(n) size, O(log n) depth combinational circuit 19 that computes Z P G ( for any fixed . Thus, the results of Cohen and Megiddo summarized in Section 3 imply that the Lagrangian dual can be solved in O(n log 2d n) time. Using weighted multidimensional search and Lemma ....
D. Fern'andez-Baca and G. Slutzki. Parametric problems on graphs of bounded tree-width. In Proceedings of the 3rd Scandinavian Workshop on Algorithm Theory, Springer-Verlag LNCS, 1992.
Optimal Parametric Search on Graphs of Bounded Tree-width - Fernandez-Baca, Slutzki (1994) Self-citation (Slutzki) (Correct)
....weights are assumed to be continuous functions of a parameter . The cost of the optimum solution is described by a real valued function ZG ( that subdivides the axis into a sequence of intervals, where each interval is a maximal connected set of values for which a particular subgraph is optimal [FeSl94]. The boundary points between intervals are called breakpoints. Three types of search problems will concern us: P1) Given a value 1 find the first breakpoint such that 1 . P2) Find a value such that ZG ( 0. We assume that such a exists. P3) Find such that ZG ....
....v 1 ; v r , the decomposition G v = ffi(v) G v 1 ; G vr ) is ffl balanced. The height of an ffl balanced parse tree T is clearly O(log n) It is known that there exists a subset R 0 U[4w 4; 5] such that every G 2 Gamma w has a O(log n) height parse tree over R 0 (see [Lag90, FeSl94]; a similar result was independently proved by Frederickson [Fre93] Suppose we have a procedure Decompose, whose details will be supplied shortly, which obtains a 7=8 balanced decomposition with respect to U[5w 5; 3] of any (5w 5) terminal graph of tree width w. To obtain a 7 8 balanced ....
[Article contains additional citation context not shown here]
D. Fern'andez-Baca and G. Slutzki. Parametric problems on graphs of bounded tree-width. J. Algorithms, 16:408--430 (1994).
An Efficient Multi-Dimensional Searching Technique and.. - Agarwal, Sharir, Toledo (1993) (2 citations) (Correct)
No context found.
D. Fern'andez-Baca and G. Slutzki, Parametric problems on graphs of bounded tree-width, Proc. 3rd Scandinavian Workshop on Algorithm Theory , Lecture Notes in Computer Science 621, 1992, pp. 304--316.
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