Computing Large Matchings in Planar Graphs with Fixed Minimum Degree (Q3652274)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computing Large Matchings in Planar Graphs with Fixed Minimum Degree |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing Large Matchings in Planar Graphs with Fixed Minimum Degree |
scientific article |
Statements
Computing Large Matchings in Planar Graphs with Fixed Minimum Degree (English)
0 references
17 December 2009
0 references
algorithms
0 references
computing large matchings
0 references
fixed minimum degree
0 references
computing maximum matchings
0 references
