2487 search results - page 279 / 498 » Partitions of Graphs into Trees |
134
Voted
COMPGEOM
1993
ACM
15 years 7 months ago
1993
ACM
For a polygon P, the bounded Voronoi diagram of P is a partition of P into regions assigned to the vertices of P. A point p inside P belongs to the region of a vertex v if and onl...
116
click to vote
ASPDAC
2005
ACM
15 years 5 months ago
2005
ACM
—The feasibility of a message in a network concerns if its timing property can be satisfied without jeopardizing any messages already in the network to meet their timing propert...
126
Voted
CEE
2006
15 years 3 months ago
2006
The expected number of transmissions is a very important parameter to evaluate the multicast performance. It is often used to estimate the bandwidth consumption of tree-based reli...
117
Voted
VLSID
2002
IEEE
16 years 4 months ago
2002
IEEE
Interconnect delay has become a critical factor in determining the performance of integrated circuits. Routing and buffering are powerful means of improving the circuit speed and ...
123
Voted
SODA
2010
ACM
16 years 1 months ago
2010
ACM
The group Steiner problem is a classical network design problem where we are given a graph and a collection of groups of vertices, and want to build a min-cost subgraph that conne...