Sciweavers

1605 search results - page 79 / 321
» On Partitional Labelings of Graphs
Sort
View
CATS
2008
13 years 11 months ago
Parameterized Complexity of the Clique Partition Problem
The problem of deciding whether the edge-set of a given graph can be partitioned into at most k cliques is well known to be NP-complete. In this paper we investigate this problem ...
Egbert Mujuni, Frances A. Rosamond
DAM
2006
81views more  DAM 2006»
13 years 9 months ago
The satisfactory partition problem
The Satisfactory Partition problem consists in deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neigh...
Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten
CORR
2010
Springer
114views Education» more  CORR 2010»
13 years 8 months ago
On weakly optimal partitions in modular networks
Abstract. Modularity was introduced as a measure of goodness for the community structure induced by a partition of the set of vertices in a graph. Then, it also became an objective...
José Ignacio Alvarez-Hamelin, Beiró ...
DATE
1999
IEEE
138views Hardware» more  DATE 1999»
14 years 1 months ago
Codex-dp: Co-design of Communicating Systems Using Dynamic Programming
We present a novel algorithm based on dynamic programming with binning to find, subject to a given deadline, the minimum-cost coarse-grain hardware/software partitioning and mappin...
Jui-Ming Chang, Massoud Pedram
CVPR
2009
IEEE
14 years 4 months ago
Automatic facial landmark labeling with minimal supervision
Landmark labeling of training images is essential for many learning tasks in computer vision, such as object detection, tracking, and alignment. Image labeling is typically conduc...
Yan Tong, Xiaoming Liu 0002, Frederick W. Wheeler,...