684 search results - page 4 / 137 » On embedding well-separable graphs |
64
Voted
ICCV
2011
IEEE
13 years 9 months ago
2011
IEEE
We present a new framework in which image segmentation, figure/ground organization, and object detection all appear as the result of solving a single grouping problem. This frame...
JGT
2007
14 years 9 months ago
2007
: Let G be a 3-connected planar graph and G∗ be its dual. We show that the pathwidth of G∗ is at most 6 times the pathwidth of G. We prove this result by relating the pathwidth...
EMSOFT
2011
Springer
13 years 9 months ago
2011
Springer
Most of the hard-real-time scheduling theory for multiprocessor systems assumes independent periodic or sporadic tasks. Such a simple task model is not directly applicable to mode...
85
Voted
COMPGEOM
2004
ACM
15 years 3 months ago
2004
ACM
We prove that the geometric thickness of graphs whose maximum degree is no more than four is two. In our proofs, we present a space and time efficient embedding technique for gra...
GG
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. In the context of graph transformation we look at the operation of switching, which can be viewed as an elegant method for realizing global transformations of (group-labe...