1857 search results - page 229 / 372 » Minimum Degree Orderings |
174
click to vote
FSTTCS
2007
Springer
16 years 20 days ago
2007
Springer
The Directed Maximum Leaf Out-Branching problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this pa...
167
click to vote
HPCC
2007
Springer
16 years 19 days ago
2007
Springer
Computing ”in-place and in-order”FFT poses a very difficult problem on hierarchical memory architectures where data movement can seriously degrade the performance. In this pape...
168
click to vote
ICALP
2007
Springer
16 years 19 days ago
2007
Springer
Abstract. The edit distance between two ordered rooted trees with vertex labels is the minimum cost of transforming one tree into the other by a sequence of elementary operations c...
152
click to vote
IPSN
2007
Springer
16 years 19 days ago
2007
Springer
We present SPOT, a scalable power observation tool that enables in situ measurement of nodal power and energy over a dynamic range exceeding four decades or a temporal resolution ...
149
click to vote
ISAAC
2007
Springer
16 years 19 days ago
2007
Springer
Abstract. We consider the problem of designing succinct representations of labeled graphs (we consider vertex labeled planar triangulations, as well as edge labeled planar graphs a...