684 search results - page 37 / 137 » On embedding well-separable graphs |
185
Voted
COMPGEOM
2004
ACM
15 years 10 months ago
2004
ACM
A frequently arising problem in computational geometry is when a physical structure, such as an ad-hoc wireless sensor network or a protein backbone, can measure local information...
176
click to vote
COMPGEOM
2010
ACM
15 years 10 months ago
2010
ACM
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...
154
click to vote
JGAA
2002
15 years 5 months ago
2002
We address in this paper the problem of constructing embeddings of planar graphs satisfying declarative, user-defined topological constraints. The constraints consist each of a cy...
209
Voted
IPMI
2011
Springer
14 years 8 months ago
2011
Springer
In this paper we construct an atlas that captures functional characteristics of a cognitive process from a population of individuals. The functional connectivity is encoded in a lo...
149
Voted
PODC
2009
ACM
16 years 5 months ago
2009
ACM
In 2004, Klavins et al. introduced the use of graph grammars to describe--and to program--systems of self-assembly. It turns out that these graph grammars can be embedded in a gra...