691 search results - page 39 / 139 » Non-negative graph embedding |
140
click to vote
JGAA
2002
15 years 3 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...
187
click to vote
IPMI
2011
Springer
14 years 7 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...
126
click to vote
PODC
2009
ACM
16 years 4 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...
146
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
The crossing number of a graph is the least number of pairwise edge crossings in a drawing of the graph in the plane. We provide an O(n log n) time constant factor approximation al...
132
Voted
STACS
2009
Springer
15 years 10 months ago
2009
Springer
We present the first polynomial-time approximation schemes (PTASes) for the following subset-connectivity problems in edge-weighted graphs of bounded genus: Steiner tree, low-conn...