Partial inverse maximum spanning tree in which weight can only be decreased under \(l_p\)-norm (Q1704922)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Partial inverse maximum spanning tree in which weight can only be decreased under l_p-norm |
scientific article; zbMATH DE number 6849602
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Partial inverse maximum spanning tree in which weight can only be decreased under \(l_p\)-norm |
scientific article; zbMATH DE number 6849602 |
Statements
Partial inverse maximum spanning tree in which weight can only be decreased under \(l_p\)-norm (English)
0 references
13 March 2018
0 references
partial inverse problem
0 references
spanning tree
0 references
polynomial time algorithm
0 references
computational complexity
0 references
0 references
0 references
0 references
0.8935742378234863
0 references
0.8856611847877502
0 references
0.8815699219703674
0 references
0.8744169473648071
0 references
0.8559021353721619
0 references
