1952 search results - page 154 / 391 » Complete partitions of graphs |
114
click to vote
AAIM
2007
Springer
15 years 10 months ago
2007
Springer
The Generalized Maximum Dispersion problem asks for a partition of a given graph into p vertex-disjoint sets, each of them having at most k vertices. The goal is to maximize the to...
122
click to vote
COMPGEOM
1995
ACM
15 years 8 months ago
1995
ACM
We outline an algorithm and implementation of a system that computes Boolean combinations of sculptured solids. We represent the surface of the solids in terms of trimmed and untr...
140
click to vote
BMCBI
2010
15 years 4 months ago
2010
Background: Extensive and automated data integration in bioinformatics facilitates the construction of large, complex biological networks. However, the challenge lies in the inter...
152
click to vote
ICDCS
2010
IEEE
15 years 6 months ago
2010
IEEE
Abstract—Coverage problem is a fundamental issue in wireless ad hoc and sensor networks. Previous techniques for coverage scheduling often require accurate location information o...
151
click to vote
AVBPA
2003
Springer
15 years 9 months ago
2003
Springer
In this paper a completely automatic face recognition system is presented. The system is inspired by the elastic bunch graph method, but the fiducial point localization is complet...