4491 search results - page 160 / 899 » Algorithm Engineering |
144
click to vote
FSTTCS
2001
Springer
15 years 6 months ago
2001
Springer
Consider a directed graph G = (V, E) with n vertices and a root vertex r ∈ V . The DMDST problem for G is one of constructing a spanning tree rooted at r, whose maximal degree is...
119
click to vote
DKE
2008
15 years 2 months ago
2008
Processing and extracting meaningful knowledge from count data is an important problem in data mining. The volume of data is increasing dramatically as the data is generated by da...
116
click to vote
FSTTCS
2000
Springer
15 years 5 months ago
2000
Springer
We investigate a variant of on-line edge-coloring in which there is a fixed number of colors availableandtheaimistocolorasmanyedgesaspossible.Weproveupperandlowerboundsontheperform...
100
click to vote
ARCS
2006
Springer
15 years 5 months ago
2006
Springer
An n-node tree has to be explored by a group of k mobile robots deployed initially at the root. Robots traverse the edges of the tree until all nodes are visited. We would like to ...
IWPC
2003
IEEE
15 years 7 months ago
2003
IEEE
Legacy code can often be made more understandable and maintainable by extracting out selected sets of statements to form procedures and replacing the extracted code with procedure...