1952 search results - page 88 / 391 » Complete partitions of graphs |
146
click to vote
TMI
2008
15 years 4 months ago
2008
Abstract-- In this paper, we propose a new method to construct graphical representations of cortical folding patterns by computing skeletons on triangulated cortical surfaces. In o...
155
click to vote
ALGORITHMICA
2010
15 years 4 months ago
2010
We study the merging process when Kruskal's algorithm is run with random graphs as inputs. Our aim is to analyze this process when the underlying graph is the complete graph ...
130
click to vote
DM
2006
15 years 4 months ago
2006
Assuming that every proper minor closed class of graphs contains a maximum with respect to the homomorphism order, we prove that such a maximum must be homomorphically equivalent ...
146
click to vote
ICCV
2005
IEEE
16 years 6 months ago
2005
IEEE
Many parameter estimation problems admit divide and conquer or partitioning techniques in order to reduce a highdimensional task into several reduced-dimension problems. These tec...
128
click to vote
WG
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...