320 search results - page 45 / 64 » Parity Problems in Planar Graphs |
150
click to vote
DCC
2010
IEEE
15 years 11 months ago
2010
IEEE
This paper interprets image interpolation as a channel decoding problem and proposes a tanner graph based interpolation framework, which regards each pixel in an image as a variab...
160
click to vote
STACS
2010
Springer
16 years 29 days ago
2010
Springer
Reachability and shortest path problems are NL-complete for general graphs. They are known to be in L for graphs of tree-width 2 [14]. However, for graphs of treewidth larger than ...
172
click to vote
WG
2001
Springer
15 years 10 months ago
2001
Springer
In a graph coloring, each color class induces a disjoint union of isolated vertices. A graph subcoloring generalizes this concept, since here each color class induces a disjoint un...
158
click to vote
ICC
2007
IEEE
16 years 9 days ago
2007
IEEE
— Low-Density Parity-Check (LDPC) codes are usually decoded by running an iterative belief-propagation, or message-passing, algorithm over the factor graph of the code. The tradi...
165
click to vote
ICALP
2001
Springer
15 years 10 months ago
2001
Springer
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...