Sciweavers

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

105

Voted

ISAAC
2009
Springer

133views Algorithms» more ISAAC 2009»

Computing Large Matchings in Planar Graphs with Fixed Minimum Degree

15 years 9 months ago

Computing Large Matchings in Planar Graphs with Fixed Minimum Degree

Download i11www.iti.uni-karlsruhe.de

Robert Franke, Ignaz Rutter, Dorothea Wagner

Real-time Traffic

Algorithms | ISAAC 2009 |

claim paper

Related Content

» Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor

» Bandwidth expansion treewidth separators and universality for boundeddegree graphs

» Graph drawings with few slopes

» Counting Subgraphs via Homomorphisms

» Fixing MaxProduct Convergent Message Passing Algorithms for MAP LPRelaxations

» Minimum time point assignment for coverage by two constrained robots

» The Bidimensional Theory of BoundedGenus Graphs

» Coverage of a Planar Point Set With Multiple Robots Subject to Geometric Constraints

Post Info
More Details (n/a)

Added	26 May 2010
Updated	26 May 2010
Type	Conference
Year	2009
Where	ISAAC
Authors	Robert Franke, Ignaz Rutter, Dorothea Wagner

Comments (0)