1054 search results - page 65 / 211 » Capacitated Domination Problem |
125
click to vote
VLSID
2006
IEEE
16 years 3 months ago
2006
IEEE
SoC design methodologies are under constant revision due to adoption of fast shrinking process technologies at nanometer levels. Nanometer process geometries exhibit new complex d...
110
click to vote
RTA
2010
Springer
15 years 5 months ago
2010
Springer
We consider the problem of computing, out of a set C of trees and a rewrite system R, those trees in C that cannot be rewritten into a tree in C. We solve this problem for sets of ...
144
click to vote
MFCS
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....
123
click to vote
DAM
2010
15 years 3 months ago
2010
We study P6-free graphs, i.e., graphs that do not contain an induced path on six vertices. Our main result is a new characterization of this graph class: a graph G is P6-free if an...
139
click to vote
FSKD
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. A fuzzy c-means algorithm incorporating the notion of dominant colors and spatial homogeneity is proposed for the color clustering problem. The proposed algorithm extract...