The neighbour-scattering number can be computed in polynomial time for interval graphs (Q1005803)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5527014
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The neighbour-scattering number can be computed in polynomial time for interval graphs |
scientific article; zbMATH DE number 5527014 |
Statements
The neighbour-scattering number can be computed in polynomial time for interval graphs (English)
0 references
10 March 2009
0 references
neighbour-scattering number
0 references
interval graph
0 references
consecutive clique arrangement
0 references
0 references
0.8385857939720154
0 references
0.8382606506347656
0 references
0.7844671607017517
0 references
0.7728927731513977
0 references
0.7543652653694153
0 references
