1952 search results - page 73 / 391 » Complete partitions of graphs |
132
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
We investigate here the computational complexity of three natural problems in directed acyclic graphs. We prove their NP Completeness and consider their restrictions to linear orde...
142
click to vote
ACSD
2010
IEEE
15 years 2 months ago
2010
IEEE
Self-timed circuits present an attractive solution to the problem of process variation. However, implementing selftimed combinational logic can be complex and expensive. This pape...
144
Voted
FOCM
2007
15 years 4 months ago
2007
We consider the regression problem and describe an algorithm approximating the regression function by estimators piecewise constant on the elements of an adaptive partition. The pa...
116
click to vote
ICCAD
1997
IEEE
15 years 8 months ago
1997
IEEE
Logic replication, the duplication of logic in order to limit communication between partitions, is an effective part of a complete partitioning solution. In this paper we seek a b...
118
click to vote
COCOON
2005
Springer
15 years 9 months ago
2005
Springer
The Satisfactory Partition problem consists of 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 neighb...