34 search results - page 1 / 7 » On the Extension of Bipartite to Parity Graphs |
DAM
1999
13 years 4 months ago
1999
Parity graphs form a superclass of bipartite and distance-hereditary graphs. Since their introduction, all the algorithms proposed as solutions to the recognition problem and othe...
TCOM
2011
12 years 11 months ago
2011
—Low-density parity-check (LDPC) codes are gaining interest for high data rate applications in both terrestrial and spatial communications. They can be designed and studied throu...
CSL
2007
Springer
13 years 11 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...
DM
2007
13 years 4 months ago
2007
Switch-setting games like Lights Out are typically modelled as a graph, where the vertices represent switches and lamps, and the edges capture the switching rules. We generalize t...
SIAMDM
2008
13 years 4 months ago
2008
A graph G is strict quasi parity (SQP) if every induced subgraph of G that is not a clique contains a pair of vertices with no odd chordless path between them (an even pair). Houga...