496 search results - page 44 / 100 » C4-saturated bipartite graphs |
STOC
1998
ACM
13 years 12 months ago
1998
ACM
In [6], Gallager introduces a family of codes based on sparse bipartite graphs, which he calls low-density parity-check codes. He suggests a natural decoding algorithm for these c...
CSL
2007
Springer
14 years 1 months ago
2007
Springer
The question of the exact complexity of solving parity games is one of the major open problems in system verification, as it is equivalent to the problem of model-checking the mod...
SIAMDM
2010
13 years 6 months ago
2010
Let s < t be two fixed positive integers. We study what are the minimum degree conditions for a bipartite graph G, with both color classes of size n = k(s + t), which ensure t...
WG
1993
Springer
13 years 11 months ago
1993
Springer
Recently in several papers, graphs with maximum neighborhood orderings were characterized and turned out to be algorithmically useful. This paper gives a unified framework for cha...
SIGIR
2006
ACM
14 years 1 months ago
2006
ACM
We present an approach to improving the precision of an initial document ranking wherein we utilize cluster information within a graph-based framework. The main idea is to perform...