5100 search results - page 98 / 1020 » The Linear Complexity of a Graph |
CORR
1999
Springer
13 years 8 months ago
1999
Springer
We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Our results are based on a technique of partitioning the planar graph ...
NIPS
2007
13 years 10 months ago
2007
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
TSP
2008
13 years 9 months ago
2008
We propose low-complexity block turbo equalizers for orthogonal frequency-division multiplexing (OFDM) systems in time-varying channels. The presented work is based on a soft minim...
DM
2008
13 years 9 months ago
2008
A triangular grid graph is a finite induced subgraph of the infinite graph associated with the two-dimensional triangular grid. In 2000, Reay and Zamfirescu showed that all 2-conne...
ESA
2000
Springer
14 years 24 days ago
2000
Springer
Abstract. The depth of a planar embedding is a measure of the topological nesting of the biconnected components of the graph. Minimizing the depth of planar embeddings has importan...