Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

24

DAM
1999

favoriteEmaildiscussreport

81views more DAM 1999»

On the Extension of Bipartite to Parity Graphs

13 years 10 months ago

On the Extension of Bipartite to Parity Graphs

Download www.csie.ntu.edu.tw

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 other combinatorial problems exploit the structural property of these graphs described by Burlet and Uhry (Berge and Chv

Serafino Cicerone, Gabriele Di Stefano

Real-time Traffic

DAM 1999 | Parity Graph | Recognition Problem | Structural Property |

claim paper

Related Content

» On Girth Conditioning for LowDensity ParityCheck Codes

» CliqueWidth and Parity Games

» Generalized switchsetting problems

» On Planar QuasiParity Graphs

» Generalized DominoParity Inequalities for the Symmetric Traveling Salesman Problem

» Polar cographs

» Robust ReputationBased Ranking on Bipartite Rating Networks

» A Correspondence Between Maximal Complete Bipartite Subgraphs and Closed Patterns

» Implementing LDPC Decoding on NetworkonChip

Post Info
More Details (n/a)

Added	22 Dec 2010
Updated	22 Dec 2010
Type	Journal
Year	1999
Where	DAM
Authors	Serafino Cicerone, Gabriele Di Stefano

Comments (0)