2314 search results - page 66 / 463 » Minimal Partitions of a Graph |
141
Voted
SCAM
2003
IEEE
15 years 10 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...
105
Voted
STOC
2006
ACM
16 years 5 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
133
click to vote
EOR
2010
15 years 5 months ago
2010
Traditionally, clustering problems are investigated under the assumption that all objects must be clustered. A shortcoming of this formulation is that a few distant objects, calle...
128
Voted
DM
2006
15 years 5 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...
131
click to vote
ISSS
1997
IEEE
15 years 9 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...