Optimal centrality computations within bounded clique-width graphs (Q2093567)
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 7608288
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal centrality computations within bounded clique-width graphs |
scientific article; zbMATH DE number 7608288 |
Statements
Optimal centrality computations within bounded clique-width graphs (English)
0 references
27 October 2022
0 references
clique-width
0 references
centralities computation
0 references
facility location problems
0 references
distance-labeling scheme
0 references
fine-grained complexity in P
0 references
graph theory
0 references
0 references
0 references
0 references
0 references
0 references
0.9993612766265868
0 references
0.7525213956832886
0 references
0.7490217089653015
0 references
0.7465853095054626
0 references
0.7400636672973633
0 references
