Sciweavers

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

7

ESA
2010
Springer

favoriteEmaildiscussreport

138views Algorithms» more ESA 2010»

Induced Matchings in Subcubic Planar Graphs

13 years 5 months ago

Induced Matchings in Subcubic Planar Graphs

Download www.dur.ac.uk

Ross J. Kang, Matthias Mnich, Tobias Müller

Real-time Traffic

Algorithms | ESA 2010 |

claim paper

Related Content

» Fast Matching of Planar Shapes in Subcubic Runtime

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

» Improved Induced Matchings in Sparse Graphs

» Trees and Matchings

» PCTrees vs PQTrees

Post Info
More Details (n/a)

Added	09 Nov 2010
Updated	09 Nov 2010
Type	Conference
Year	2010
Where	ESA
Authors	Ross J. Kang, Matthias Mnich, Tobias Müller

Comments (0)