2314 search results - page 169 / 463 » Minimal Partitions of a Graph |
119
Voted
IPPS
2006
IEEE
15 years 10 months ago
2006
IEEE
This paper presents a parallel framework of grid-based numerical algorithms where data dependencies between grid zones can be modeled by a directed acyclic graph (DAG). It consist...
115
click to vote
DAC
1996
ACM
15 years 8 months ago
1996
ACM
We offer a technique to partition a centralized control-flow graph to obtain distributed control in the context of asynchronous highlevel synthesis. The technique targets Huffman-...
129
click to vote
GC
2006
Springer
15 years 4 months ago
2006
Springer
An n-partite tournament is an orientation of a complete n-partite graph. An npartite tournament is a tournament, if it contains exactly one vertex in each partite set. Douglas, Pr...
122
click to vote
ACL
2009
15 years 1 months ago
2009
Identifying whether a multi-word expression (MWE) is compositional or not is important for numerous NLP applications. Sense induction can partition the context of MWEs into semant...
176
click to vote
ICALP
2005
Springer
15 years 9 months ago
2005
Springer
Given a graph G = (V, E) and positive integral vertex weights w : V → N, the max-coloring problem seeks to find a proper vertex coloring of G whose color classes C1, C2, . . . ,...