Computing large matchings in planar graphs with fixed minimum degree
type: Item
instance of: scholarly article
title: Computing large matchings in planar graphs with fixed minimum degree
zbMATH Open document ID: 1217.68250
author: Robert Franke
author: Ignaz Rutter
author: Dorothea Wagner
published in: Theoretical Computer Science
publication date: 2011-07-27T00:00:00Z
full work available at URL: https://publikationen.bibliothek.kit.edu/1000012970
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 5932525
zbMATH Keywords: large matching
zbMATH Keywords: mindeg-3 graph
zbMATH Keywords: planar graph
zbMATH Keywords: linear-time
describes a project that uses: Boost
describes a project that uses: BGL
MaRDI profile type: Publication
OpenAlex ID: W1964708784
cites work: Matching theory
cites work: Maximum matchings in planar graphs via Gaussian elimination
cites work: Q2934588
cites work: Matrix multiplication via arithmetic progressions
cites work: Q3707420
cites work: On Representatives of Subsets
cites work: The Factorization of Linear Graphs
cites work: Bipartite Edge Coloring in $O(\Delta m)$ Time
cites work: Edge-coloring bipartite multigraphs in \(O(E \log D)\) time
cites work: Efficient algorithms for Petersen's matching theorem
cites work: Conway's Tiling Groups
cites work: A linear algorithm for perfect matching in hexagonal systems
cites work: Perfect matchings in the triangular lattice
cites work: Flow in Planar Graphs with Multiple Sources and Sinks
cites work: Planar graphs, negative weight edges, shortest paths, and near linear time
cites work: Unique maximum matching algorithms
cites work: Lower bounds on the cardinality of the maximum matchings of planar graphs
cites work: Tight bounds on maximal and maximum matchings
cites work: Computing large matchings fast
cites work: Q3579370
cites work: Matching for Graphs of Bounded Degree
DOI: 10.1016/J.TCS.2010.06.012
description: scientific article; zbMATH DE number 5932525