5889 search results - page 248 / 1178 » Graph Layout Problems |
166
Voted
COCOON
2006
Springer
15 years 10 months ago
2006
Springer
: Inferring graphs from path frequency has been studied as an important problem which has a potential application to drug design and elucidation of chemical structures. Given a mul...
198
click to vote
LION
2009
Springer
16 years 1 months ago
2009
Springer
Graph partitioning is a well-known optimization problem of great interest in theoretical and applied studies. Since the 1990s, many multilevel schemes have been introduced as a pra...
153
click to vote
EVOW
2006
Springer
15 years 10 months ago
2006
Springer
The k-cut problem is an NP-complete problem which consists of finding a partition of a graph into k balanced parts such that the number of cut edges is minimized. Different algori...
175
click to vote
SDM
2007
SIAM
15 years 8 months ago
2007
SIAM
In this paper we formulate spectral clustering in directed graphs as an optimization problem, the objective being a weighted cut in the directed graph. This objective extends seve...
182
click to vote
JDA
2006
15 years 6 months ago
2006
Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are nonnegative integers. One wishes to partition G into connected components by del...