3020 search results - page 53 / 604 » Optimal partition trees |
146
Voted
DMTCS
2010
15 years 1 months ago
2010
Motivated by the bijection between Schnyder labelings of a plane triangulation and partitions of its inner edges into three trees, we look for binary labelings for quadrangulation...
130
click to vote
VLSID
2002
IEEE
16 years 4 months ago
2002
IEEE
In this paper, we present a functional partitioning method for low power real-time distributed embedded systems whose constituent nodes are systems-on-a-chip (SOCs). The systemlev...
119
Voted
EUROPAR
1999
Springer
15 years 8 months ago
1999
Springer
Recently, a number of graph partitioning applications have emerged with additional requirements that the traditional graph partitioning model alone cannot e ectively handle. One s...
169
Voted
SODA
2008
ACM
15 years 5 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...
131
Voted
SPAA
2006
ACM
15 years 9 months ago
2006
ACM
Tree contraction algorithms, whose idea was first proposed by Miller and Reif, are important parallel algorithms to implement efficient parallel programs manipulating trees. Desp...