Induced Matchings in Subcubic Planar Graphs

Ross J. Kang; Matthias Mnich; Tobas Müller

doi:10.1007/978-3-642-15781-3_10

Induced Matchings in Subcubic Planar Graphs

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

Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceeding › Academic › peer-review

Abstract

We present a linear-time algorithm that, given a planar graph with m edges and maximum degree 3, finds an induced matching of size at least m/9. This is best possible.

Original language	English
Title of host publication	Algorithms - ESA 2010
Subtitle of host publication	18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part II
Publisher	Springer
Pages	112-122
DOIs	https://doi.org/10.1007/978-3-642-15781-3_10
Publication status	Published - 2010
Externally published	Yes

Publication series

Series	Lecture Notes in Computer Science
Volume	6347

Access to Document

10.1007/978-3-642-15781-3_10

Cite this

@inproceedings{6191d98820e641a3ac8554820d7fe8f5,

title = "Induced Matchings in Subcubic Planar Graphs",

abstract = "We present a linear-time algorithm that, given a planar graph with m edges and maximum degree 3, finds an induced matching of size at least m/9. This is best possible.",

author = "Kang, {Ross J.} and Matthias Mnich and Tobas M{\"u}ller",

year = "2010",

doi = "10.1007/978-3-642-15781-3_10",

language = "English",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "112--122",

booktitle = "Algorithms - ESA 2010",

address = "United States",

}

Induced Matchings in Subcubic Planar Graphs. / Kang, Ross J.; Mnich, Matthias; Müller, Tobas.
Algorithms - ESA 2010: 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part II. Springer, 2010. p. 112-122 (Lecture Notes in Computer Science, Vol. 6347).

Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceeding › Academic › peer-review

TY - GEN

T1 - Induced Matchings in Subcubic Planar Graphs

AU - Kang, Ross J.

AU - Mnich, Matthias

AU - Müller, Tobas

PY - 2010

Y1 - 2010

N2 - We present a linear-time algorithm that, given a planar graph with m edges and maximum degree 3, finds an induced matching of size at least m/9. This is best possible.

AB - We present a linear-time algorithm that, given a planar graph with m edges and maximum degree 3, finds an induced matching of size at least m/9. This is best possible.

U2 - 10.1007/978-3-642-15781-3_10

DO - 10.1007/978-3-642-15781-3_10

M3 - Conference article in proceeding

T3 - Lecture Notes in Computer Science

SP - 112

EP - 122

BT - Algorithms - ESA 2010

PB - Springer

ER -