127 search results - page 9 / 26 » Acyclic dominating partitions |
GLVLSI
2006
IEEE
14 years 1 months ago
2006
IEEE
Most of the logic synthesis algorithms are not scalable for large networks and, for this reason, partitioning is often applied. However traditional mincut-based partitioning techn...
CJCDGCGT
2005
Springer
13 years 9 months ago
2005
Springer
The vertex arboricity va(G) of a graph G is the minimum number of subsets into which the vertex set V (G) can be partitioned so that each subset induces an acyclic subgraph. The f...
DAC
2004
ACM
14 years 8 months ago
2004
ACM
This paper presents the Quantum-Dot Cellular Automata (QCA) physical design problem, in the context of the VLSI physical design problem. The problem is divided into three subprobl...
CPAIOR
2007
Springer
14 years 1 months ago
2007
Springer
Given a directed graph G, the K node-disjoint paths problem consists in finding a partition of G into K node-disjoint paths, such that each path ends up in a given subset of nodes...
SSS
2009
Springer
14 years 2 months ago
2009
Springer
We consider setting up sleep scheduling in sensor networks. We formulate the problem as an instance of the fractional domatic partition problem and obtain a distributed approximati...