5889 search results - page 469 / 1178 » Graph Layout Problems |
208
click to vote
NETWORKS
2006
15 years 7 months ago
2006
Abstract. The Steiner tree problem is to find a shortest subgraph that spans a given set of vertices in a graph. This problem is known to be NP-hard and it is well known that a pol...
201
click to vote
ICDE
2010
IEEE
16 years 7 months ago
2010
IEEE
The increasing popularity of social networks has initiated a fertile research area in information extraction and data mining. Although such analysis can facilitate better understan...
228
click to vote
EVOW
2009
Springer
16 years 2 months ago
2009
Springer
We present a hybrid evolutionary algorithm for the graph coloring problem (Evocol). Evocol is based on two simple-but-effective ideas. First, we use an enhanced crossover that col...
215
click to vote
CVPR
2006
IEEE
16 years 1 months ago
2006
IEEE
This paper adds a number of novel concepts into global s/t cut methods improving their efficiency and making them relevant for a wider class of applications in vision where algor...
210
click to vote
3DIM
2003
IEEE
16 years 28 days ago
2003
IEEE
Segmentation of 3D human body (HB) scan is a very challenging problem in applications exploiting human scan data. To tackle this problem, this paper proposes a topological approac...