823 search results - page 42 / 165 » Brick partitions of graphs |
176
click to vote
CATS
2006
15 years 7 months ago
2006
We consider the following clustering problems: given a general undirected graph, partition its vertices into disjoint clusters such that each cluster forms a clique and the number...
158
click to vote
SCAM
2003
IEEE
15 years 11 months ago
2003
IEEE
Many static analyses aim at assigning to each control point of a program an invariant property that characterizes any state of a trace corresponding to this point. The choice of t...
119
click to vote
STOC
2006
ACM
16 years 6 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
145
click to vote
DM
2006
15 years 6 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...
153
click to vote
ISSS
1997
IEEE
15 years 10 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...