Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. II: Algorithms (Q2985116)
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 6715878
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. II: Algorithms |
scientific article; zbMATH DE number 6715878 |
Statements
Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. Chapter II: algorithms (English)
0 references
16 May 2017
0 references
0 references
0 references
0 references
0.9538869857788086
0 references
0.8111118078231812
0 references
0.7838886976242065
0 references
0.7684448957443237
0 references
0.762168824672699
0 references
