446 search results - page 7 / 90 » Extremal Stable Graphs |
HICSS
2008
IEEE
14 years 2 months ago
2008
IEEE
In this work we apply graph theoretic tools to provide a close bound on a frontier relating the number of line outages in a grid to the power disrupted by the outages. This fronti...
ORL
2008
13 years 8 months ago
2008
Barahona and Mahjoub found a defining system of the stable set polytope for a graph with a cut-set of cardinality 2. We extend this result to cut-sets composed of a complete graph...
SIAMNUM
2011
12 years 11 months ago
2011
Abstract. When studying the ε-pseudospectrum of a matrix, one is often interested in computing the extremal points having maximum real part or modulus. This is a crucial step, for...
SIAMDM
2000
13 years 8 months ago
2000
A graph is a split graph if its vertices can be partitioned into a clique and a stable set. A graph is a k-split graph if its vertices can be partitioned into k sets, each of which...
CVPR
2007
IEEE
14 years 10 months ago
2007
IEEE
This paper introduces a novel colour-based affine covariant region detector. Our algorithm is an extension of the maximally stable extremal region (MSER) to colour. The extension ...