Algorithms for connected \(p\)-centdian problem on block graphs (Q724753)
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 6910555
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for connected \(p\)-centdian problem on block graphs |
scientific article; zbMATH DE number 6910555 |
Statements
Algorithms for connected \(p\)-centdian problem on block graphs (English)
0 references
26 July 2018
0 references
connected \(p\)-center
0 references
median
0 references
centdian
0 references
block graphs
0 references
0.9654391407966614
0 references
0.883699893951416
0 references
0.8778601288795471
0 references
0.8317000865936279
0 references
0.8264409303665161
0 references
