2314 search results - page 105 / 463 » Minimal Partitions of a Graph |
133
Voted
CONSTRAINTS
2008
15 years 3 months ago
2008
The tree constraint partitions a directed graph into node-disjoint trees. In many practical applications that involve such a partition, there exist side constraints specifying requ...
118
click to vote
ARSCOM
2002
15 years 3 months ago
2002
In 1973, Deuber published his famous proof of Rado's conjecture regarding partition regular sets. In his proof, he invented structures called (m, p, c)-sets and gave a partit...
130
click to vote
CODES
2003
IEEE
15 years 9 months ago
2003
IEEE
Boolean logic minimization is traditionally used in logic synthesis tools running on powerful desktop computers. However, logic minimization has recently been proposed for dynamic...
116
Voted
ASYNC
1998
IEEE
15 years 8 months ago
1998
IEEE
None of the available minimizers for exact 2-level hazard-free logic minimization can synthesize very large circuits. This limitation has forced researchers to resort to heuristic...
151
Voted
SWAT
2004
Springer
15 years 9 months ago
2004
Springer
We study the following problem: Given a set V of n vertices and a set E of m edge pairs, we define a graph family G(V, E) as the set of graphs that have vertex set V and contain ...