Sciweavers

720 search results - page 57 / 144
» Nonrepetitive colorings of graphs
Sort
View
COLOGNETWENTE
2008
13 years 9 months ago
Exact Graph Coloring via Hybrid Approaches
Stefano Gualandi, Federico Malucelli
CCCG
2004
13 years 9 months ago
Encompassing colored crossing-free geometric graphs
Ferran Hurtado, Mikio Kano, David Rappaport, Csaba...
ESANN
2001
13 years 9 months ago
Graph extraction from color images
Abstract. An approach to symbolic contour extraction will be described that consists of three stages: enhancement, detection, and extraction of edges and corners. Edges and corners...
Tino Lourens, Kazuhiro Nakadai, Hiroshi G. Okuno, ...
SODA
2003
ACM
138views Algorithms» more  SODA 2003»
13 years 9 months ago
Multirate rearrangeable clos networks and a generalized edge coloring problem on bipartite graphs
Chung and Ross (SIAM J. Comput., 20, 1991) conjectured that the minimum number m(n, r) of middle-state switches for the symmetric 3-stage Clos network C(n, m(n, r), r) to be rearr...
Hung Q. Ngo, Van H. Vu
SODA
1992
ACM
96views Algorithms» more  SODA 1992»
13 years 8 months ago
Lower Bounds for On-Line Graph Coloring
Magnús M. Halldórsson, Mario Szegedy