1952 search results - page 71 / 391 » Complete partitions of graphs |
120
click to vote
DAM
2006
15 years 4 months ago
2006
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...
125
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
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...
133
click to vote
DATE
1999
IEEE
15 years 8 months ago
1999
IEEE
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...
148
Voted
ESA
2009
Springer
15 years 8 months ago
2009
Springer
The interval graph for a set of intervals on a line consists of one vertex for each interval, and an edge for each intersecting pair of intervals. A probe interval graph is a varia...
118
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Abstract-- We propose distributed algorithms to automatically deploy a group of robotic agents and provide coverage of a discretized environment represented by a graph. The classic...