Sciweavers

446 search results - page 2 / 90
» Extremal Stable Graphs
Sort
View
ICCV
2007
IEEE
14 years 8 months ago
Shape Descriptors for Maximally Stable Extremal Regions
This paper introduces an affine invariant shape descriptor for maximally stable extremal regions (MSER). Affine invariant feature descriptors are normally computed by sampling the...
David G. Lowe, Per-Erik Forssén
ORL
2008
101views more  ORL 2008»
13 years 6 months ago
Gear composition and the stable set polytope
We present a new graph composition that produces a graph G from a given graph H and a fixed graph B called gear and we study its polyhedral properties. This composition yields cou...
Anna Galluccio, Claudio Gentile, Paolo Ventura
ALGORITHMS
2010
114views more  ALGORITHMS 2010»
13 years 3 months ago
Graph Extremities Defined by Search Algorithms
: Graph search algorithms have exploited graph extremities, such as the leaves of a tree and the simplicial vertices of a chordal graph. Recently, several well-known graph search a...
Anne Berry, Jean R. S. Blair, Jean Paul Bordat, Ge...
DM
2008
97views more  DM 2008»
13 years 6 months ago
On extremal k-outconnected graphs
Let G be a minimally k-connected graph with n nodes and m edges. Mader proved that if n 3k - 2 then m k(n - k), and for n 3k - 1 an equality is possible if, and only if, G is t...
Zeev Nutov