Better diameter algorithms for bounded VC-dimension graphs and geometric intersection graphs (Q7253109)
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 8203262
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Better diameter algorithms for bounded VC-dimension graphs and geometric intersection graphs |
scientific article; zbMATH DE number 8203262 |
Statements
Better diameter algorithms for bounded VC-dimension graphs and geometric intersection graphs (English)
0 references
26 May 2026
0 references
graph diameter
0 references
geometric intersection graphs
0 references
Vapnik-Chervonenkis dimension
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
