823 search results - page 91 / 165 » Brick partitions of graphs |
164
click to vote
ICCD
2002
IEEE
16 years 3 months ago
2002
IEEE
Boolean functions are fundamental to synthesis and verification of digital logic, and compact representations of Boolean functions have great practical significance. Popular repre...
185
click to vote
DCC
2005
IEEE
16 years 5 months ago
2005
IEEE
We give an overview of some of the mathematical results of Dominique de Caen. These include a short proof of K?onig's theorem, results on Tur?an numbers, biclique partitions,...
165
click to vote
INFOCOM
2009
IEEE
16 years 25 days ago
2009
IEEE
Abstract—Recently, cellular phone networks have begun allowing third-party applications to run over certain open-API phone operating systems such as Windows Mobile, Iphone and Go...
142
click to vote
AAIM
2007
Springer
16 years 12 days 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...
144
click to vote
COMPGEOM
1995
ACM
15 years 9 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...