Sciweavers

1605 search results - page 128 / 321
» On Partitional Labelings of Graphs
Sort
View
COMBINATORICS
2007
72views more  COMBINATORICS 2007»
13 years 10 months ago
Matrix Partitions with Finitely Many Obstructions
Each m by m symmetric matrix M over 0, 1, ∗, defines a partition problem, in which an input graph G is to be partitioned into m parts with adjacencies governed by M, in the sen...
Tomás Feder, Pavol Hell, Wing Xie
ORDER
2008
61views more  ORDER 2008»
13 years 10 months ago
Partitioning Posets
Given a poset P = (X, ), a partition X1, . . . , Xk of X is called an ordered partition of P if, whenever x Xi and y Xj with x y, then i j. In this paper, we show that for ever...
Viresh Patel
SODA
2008
ACM
93views Algorithms» more  SODA 2008»
14 years 5 days ago
Minimum weight convex Steiner partitions
New tight bounds are presented on the minimum length of planar straight line graphs connecting n given points in the plane and having convex faces. Specifically, we show that the ...
Adrian Dumitrescu, Csaba D. Tóth
CLEIEJ
2010
13 years 8 months ago
3D-Via Driven Partitioning for 3D VLSI Integrated Circuits
A 3D circuit is the stacking of regular 2D circuits. The advances on the fabrication and packaging technologies allowed interconnecting stacked 2D circuits by using 3D vias. Howeve...
Sandro Sawicki, Gustavo Wilke, Marcelo O. Johann, ...
ECCV
2004
Springer
14 years 4 months ago
Multi-label Image Segmentation for Medical Applications Based on Graph-Theoretic Electrical Potentials
Abstract. A novel method is proposed for performing multi-label, semi-automated image segmentation. Given a small number of pixels with user-defined labels, one can analytically (...
Leo Grady, Gareth Funka-Lea