691 search results - page 51 / 139 » Non-negative graph embedding |
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
We improve the approximation ratios for two optimization problems in planar graphs. For node-weighted Steiner tree, a classical network-optimization problem, the best achievable ap...
GD
2004
Springer
14 years 1 months ago
2004
Springer
Consider the following question: does every complete geometric graph K2n have a partition of its edge set into n plane spanning trees? We approach this problem from three directio...
ICRA
2008
IEEE
14 years 2 months ago
2008
IEEE
— Novel tools are needed to deploy multi-agent networks in applications that require a high degree of accuracy in the achievement and maintenance of geometric formations. This is...
WAW
2007
Springer
14 years 2 months ago
2007
Springer
We present a new stochastic model for complex networks, based on a spatial embedding of the nodes, called the Spatial Preferred Attachment (SPA) model. In the SPA model, nodes have...
GD
2008
Springer
13 years 9 months ago
2008
Springer
A visibility representation of a graph G is to represent the nodes of G with non-overlapping horizontal line segments such that the line segments representing any two distinct adja...