1545 search results - page 195 / 309 » On tree congestion of graphs |
APVIS
2004
14 years 11 months ago
2004
Presenting large amounts of information in a limited screen space is a significant challenge in the field of Information Visualization. With the rapid development and growing use ...
MP
1998
14 years 9 months ago
1998
In this paper we consider the problem of ^-partitioning the nodes of a graph with capacity restrictions on the sum of the node weights in each subset of the partition, and the obje...
IJCNN
2007
IEEE
15 years 4 months ago
2007
IEEE
— To approximate complex data, we propose new type of low-dimensional “principal object”: principal cubic complex. This complex is a generalization of linear and nonlinear pr...
ADBIS
2007
Springer
15 years 4 months ago
2007
Springer
The M-tree and its variants have been proved to provide an efficient similarity search in database environments. In order to further improve their performance, in this paper we pro...
CP
2000
Springer
15 years 2 months ago
2000
Springer
Combinatorial problems can be efficiently tackled with constraint programming systems. The main tasks of the development of a constraint-based application are modeling the proble...