The Parameterized Complexity of the Induced Matching Problem in Planar Graphs (Q3612599): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 05:15, 5 February 2024
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
