Sciweavers

76 search results - page 1 / 16
» Judicious partitions of directed graphs
Sort
View
COMBINATORICA
1999
67views more  COMBINATORICA 1999»
13 years 4 months ago
Exact Bounds for Judicious Partitions of Graphs
Béla Bollobás, Alex D. Scott
DM
2010
98views more  DM 2010»
13 years 4 months ago
Idomatic partitions of direct products of complete graphs
In this paper we give a full characterization of the idomatic partitions of the direct product of three complete graphs. We also show how to use such a characterization in order t...
Mario Valencia-Pabon
ISCAPDCS
2003
13 years 6 months ago
Heterogeneous Hardware-Software System Partitioning using Extended Directed Acyclic Graph
In this paper, we present a system partitioning technique in which the input system specification is based on C++ language. The proposed technique processes data and precedence de...
Matthew Jin, Gul N. Khan
DAM
2007
129views more  DAM 2007»
13 years 4 months ago
Easy and hard instances of arc ranking in directed graphs
: In this paper we deal with the arc ranking problem of directed graphs. We give some classes of graphs for which the arc ranking problem is polynomially solvable. We prove that de...
Dariusz Dereniowski
ERSA
2006
86views Hardware» more  ERSA 2006»
13 years 6 months ago
GifT: A Gravity-Directed and Life-Time Based Algorithm for Temporal Partitioning of Data Flow Graphs
In reconfigurable systems, reconfiguration latency has a significant impact on the system performance. In this work, a temporal partitioning algorithm is presented to partition da...
Farhad Mehdipour, Morteza Saheb Zamani, Mehdi Sedi...