Sciweavers

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

34

COCO
2010
Springer

favoriteEmaildiscussreport

131views Algorithms» more COCO 2010»

On the Matching Problem for Special Graph Classes

13 years 8 months ago

On the Matching Problem for Special Graph Classes

Download www.uni-ulm.de

An even cycle in a graph is called nice by Lov

Thanh Minh Hoang

Real-time Traffic

Algorithms | Bipartite Planar Graphs | COCO 2010 | Maximum Matchings | Perfect Matching |

claim paper

Related Content

» SAT Algorithms for Colouring Some Special Classes of Graphs Some Theoretical and Experimen...

» Enumeration problems for classes of selfsimilar graphs

» On the Complexity of the Maximum Cut Problem

» A Comparative Study of Ant Colony Optimization and Reactive Search for Graph Matching Prob...

» Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes

» On Iterated Dominance Matrix Elimination and Matched Paths

» Graph matching with type constraints on nodes and edges

» On Routing in Circulant Graphs

» The Parameterized Complexity of the Induced Matching Problem in Planar Graphs

Post Info
More Details (n/a)

Added	01 Mar 2011
Updated	01 Mar 2011
Type	Journal
Year	2010
Where	COCO
Authors	Thanh Minh Hoang

Comments (0)