1952 search results - page 69 / 391 » Complete partitions of graphs |
101
click to vote
STOC
2006
ACM
16 years 4 months ago
2006
ACM
Let G be an n-vertex graph that has a vertex separator of size k that partitions the graph into connected components of size smaller
148
click to vote
ECCC
2010
14 years 11 months ago
2010
Consider a graph obtained by taking an edge disjoint union of k complete bipartite graphs.
118
click to vote
DM
2006
15 years 4 months ago
2006
Berge's conjecture from 1982 on path partitions in directed graphs generalizes and extends Dilworth's Theorem and the Greene-Kleitman Theorem which are well known for pa...
120
click to vote
ISSS
1997
IEEE
15 years 8 months ago
1997
IEEE
Integer Linear Programming ILP is commonly used in high level and system level synthesis. It is an NP-Complete problem in general cases . There exists some tools that give an o...
143
click to vote
IPPS
2002
IEEE
15 years 9 months ago
2002
IEEE
Multiple memory module architecture enjoys higher memory access bandwidth and thus higher performance. Two key problems in gaining high performance in this kind of architecture ar...