An efficient algorithm for finding the semi-obnoxious \((k,l)\)-core of a tree (Q2790841)
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 6551892
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient algorithm for finding the semi-obnoxious \((k,l)\)-core of a tree |
scientific article; zbMATH DE number 6551892 |
Statements
8 March 2016
0 references
core
0 references
facility location
0 references
Median subtree
0 references
semi-obnoxious
0 references
An efficient algorithm for finding the semi-obnoxious \((k,l)\)-core of a tree (English)
0 references
0.8983107209205627
0 references
0.8783354163169861
0 references
0.8738805651664734
0 references
0.8542190194129944
0 references
0.8436266779899597
0 references
