4171 search results - page 158 / 835 » Choice numbers of graphs |
207
click to vote
ICCV
2003
IEEE
16 years 8 months ago
2003
IEEE
Vision tasks, such as segmentation, grouping, recognition, can be formulated as graph partition problems. The recent literature witnessed two popular graph cut algorithms: the Ncu...
162
click to vote
WALCOM
2010
IEEE
16 years 1 months ago
2010
IEEE
Given a simple graph G, a harmonious coloring of G is a proper vertex coloring such that each pair of colors appears together on at most one edge. The harmonious chromatic number i...
196
click to vote
ICALP
2007
Springer
16 years 22 days ago
2007
Springer
Abstract. We deal with two intimately related subjects: quasi-randomness and regular partitions. The purpose of the concept of quasi-randomness is to measure how much a given graph...
164
click to vote
SAC
2005
ACM
16 years 4 days ago
2005
ACM
We present a strategy for analyzing large, social small-world graphs, such as those formed by human networks. Our approach brings together ideas from a number of different resear...
175
click to vote
GD
2009
Springer
15 years 11 months ago
2009
Springer
The geometric simultaneous embedding problem asks whether two planar graphs on the same set of vertices in the plane can be drawn using straight lines, such that each graph is pla...