2125 search results - page 117 / 425 » On Graph Complexity |
114
click to vote
CORR
2008
Springer
15 years 2 months ago
2008
Springer
Abstract--In this paper, we propose a linear complexity encoding method for arbitrary LDPC codes. We start from a simple graph-based encoding method "label-and-decide." W...
140
click to vote
STOC
2006
ACM
16 years 3 months ago
2006
ACM
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
WAW
2007
Springer
15 years 9 months ago
2007
Springer
We present a new stochastic model for complex networks, based on a spatial embedding of the nodes, called the Spatial Preferred Attachment (SPA) model. In the SPA model, nodes have...
132
click to vote
COMPGEOM
2010
ACM
15 years 8 months ago
2010
ACM
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
128
click to vote
GBRPR
2009
Springer
15 years 9 months ago
2009
Springer
Modeling and understanding complex non-manifold shapes is a key issue in shape analysis and retrieval. The topological structure of a non-manifold shape can be analyzed through its...