The Parameterized Complexity of the Induced Matching Problem in Planar Graphs (Q3612599): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 13:01, 5 March 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
