Sciweavers

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

31

GC
2007
Springer

favoriteEmaildiscussreport

90views Applied Computing» more GC 2007»

Bicolored Matchings in Some Classes of Graphs

13 years 10 months ago

Bicolored Matchings in Some Classes of Graphs

Download cedric.cnam.fr

Marie-Christine Costa, Dominique de Werra, Christo

Real-time Traffic

Applied Computing | GC 2007 |

claim paper

Related Content

» Approximation Algorithms for Some Graph Partitioning Problems

» On the Algorithmic Complexity of Twelve Covering and Independence Parameters of Graphs

» Logspace Algorithms for Paths and Matchings in ktrees

» On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Mat...

» Towards Explaining Semantic Matching

» A Note on Domino Shuffling

» On the computational complexity of strong edge coloring

» On the searchability of smallworld networks with arbitrary underlying structure

» ModelDriven Development of Model Transformations

Post Info
More Details (n/a)

Added	14 Dec 2010
Updated	14 Dec 2010
Type	Journal
Year	2007
Where	GC
Authors	Marie-Christine Costa, Dominique de Werra, Christophe Picouleau, Bernard Ries

Comments (0)