Parameterized complexity in multiple-interval graphs: partition, separation, irredundancy (Q3087939)
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: Parameterized complexity in multiple-interval graphs: partition, separation, irredundancy |
scientific article; zbMATH DE number 5939998
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parameterized complexity in multiple-interval graphs: partition, separation, irredundancy |
scientific article; zbMATH DE number 5939998 |
Statements
Parameterized Complexity in Multiple-Interval Graphs: Partition, Separation, Irredundancy (English)
0 references
17 August 2011
0 references
0.8920400738716125
0 references
0.8591299653053284
0 references
0.8248299360275269
0 references
0.7995089888572693
0 references
