3757 search results - page 231 / 752 » The overlap number of a graph |
177
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...
172
click to vote
COMPGEOM
2006
ACM
16 years 15 days ago
2006
ACM
Embedding metrics into constant-dimensional geometric spaces, such as the Euclidean plane, is relatively poorly understood. Motivated by applications in visualization, ad-hoc netw...
182
click to vote
DNA
2006
Springer
15 years 10 months ago
2006
Springer
We study the complexity of the Accretive Graph Assembly Problem (AGAP). An instance of AGAP consists of an edge-weighted graph G, a seed vertex in G, and a temperature . The goal i...
180
click to vote
JGAA
2002
15 years 6 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...
121
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. We discuss the problem of determining the complete weight hierarchy of linear error correcting codes associated to Grassmann varieties and, more generally, to Schubert va...