Generating and enumerating digitally convex sets of trees (Q295254)
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 6592589
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Generating and enumerating digitally convex sets of trees |
scientific article; zbMATH DE number 6592589 |
Statements
Generating and enumerating digitally convex sets of trees (English)
0 references
13 June 2016
0 references
properties of digitally convex sets
0 references
generating digitally convex sets of trees
0 references
bounds for the number of digitally convex sets of trees
0 references
enumerating digitally convex sets of cographs in linear time
0 references
0.9279368
0 references
0 references
0.8881364
0 references
0 references
0.8703965
0 references
0.86974263
0 references
0 references
0.86736226
0 references
0.8650507
0 references
