The Parameterized Complexity of the Induced Matching Problem in Planar Graphs (Q3612599)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Parameterized Complexity of the Induced Matching Problem in Planar Graphs |
scientific article |
Statements
The Parameterized Complexity of the Induced Matching Problem in Planar Graphs (English)
0 references
10 March 2009
0 references
