1545 search results - page 284 / 309 » On tree congestion of graphs |
SIGCSE
1997
ACM
15 years 1 months ago
1997
ACM
A typical Data Structures (CS 2) course covers a wide variety of topics: elementary algorithm analysis; data structures including dynamic structures, trees, tables, graphs, etc.; ...
111
click to vote
FSTTCS
1993
Springer
15 years 1 months ago
1993
Springer
We investigate the complexity and approximability of some location problems when two distance values are specified for each pair of potential sites. These problems involve the se...
EVOW
2009
Springer
15 years 1 months ago
2009
Springer
Abstract. This paper proposes a novel Ant Colony Optimisation algorithm for the hierarchical problem of predicting protein functions using the Gene Ontology (GO). The GO structure ...
EGH
2004
Springer
15 years 1 months ago
2004
Springer
Partitioning fragment shaders into multiple rendering passes is an effective technique for virtualizing shading resource limits in graphics hardware. The Recursive Dominator Split...
PKC
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. Efficient secure time-stamping schemes employ a 2-level approach in which the time-stamping service operates in rounds. We say that a time-stamping service is accountable...