363 search results - page 15 / 73 » Partial Multicuts in Trees |
LCN
1999
IEEE
14 years 2 months ago
1999
IEEE
This paper presents the new Shortest Best Path Tree (SBPT) algorithm for multicast trees. The SBPT algorithm establishes and maintains dynamic multicast trees which maximize the b...
COMGEO
2012
ACM
12 years 5 months ago
2012
ACM
A straight-line drawing of a plane graph G is a planar drawing of G, where each vertex is drawn as a point and each edge is drawn as a straight line segment. Given a set S of n poi...
LICS
2012
IEEE
12 years 6 days ago
2012
IEEE
—Data trees are trees in which each node, besides carrying a label from a finite alphabet, also carries a data value infinite domain. They have been used as an abstraction mode...
JAL
2002
13 years 9 months ago
2002
We take a multivariate view of digital search trees by studying the number of nodes of different types that may coexist in a bucket digital search tree as it grows under an arbitr...
SODA
2008
ACM
13 years 11 months ago
2008
ACM
We address the extension of the binary search technique from sorted arrays and totally ordered sets to trees and tree-like partially ordered sets. As in the sorted array case, the...