251 search results - page 31 / 51 » Constructive Linear Time Algorithms for Branchwidth |
116
click to vote
DCC
2006
IEEE
16 years 2 months ago
2006
IEEE
Optimal index assignment of multiple description lattice vector quantizer (MDLVQ) can be posed as a large-scale linear assignment problem. But is this expensive algorithmic approa...
121
click to vote
GECCO
2004
Springer
15 years 8 months ago
2004
Springer
The prize-collecting Steiner tree problem on a graph with edge costs and vertex profits asks for a subtree minimizing the sum of the total cost of all edges in the subtree plus th...
140
click to vote
LATA
2009
Springer
15 years 9 months ago
2009
Springer
This tutorial will present an overview of the use of Monadic Second-Order Logic to describe sets of finite graphs and graph transformations, in relation with the notions of tree-w...
138
click to vote
DAC
1989
ACM
15 years 6 months ago
1989
ACM
: We discuss a new approach to constructing the rectilinear Steiner tree (RST) of a given set of points in the plane, starting from a minimum spanning tree (MST). The main idea in ...
115
Voted
ISPA
2004
Springer
15 years 8 months ago
2004
Springer
HPL is a parallel Linpack benchmark package widely adopted in massive cluster system performance test. On HPL data layout among processors, a law to determine block size NB theoret...