Computing the fully optimal spanning tree of an ordered bipolar directed graph (Q6204322)
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: Computing the fully optimal spanning tree of an ordered bipolar directed graph |
scientific article; zbMATH DE number 7825834
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing the fully optimal spanning tree of an ordered bipolar directed graph |
scientific article; zbMATH DE number 7825834 |
Statements
Computing the fully optimal spanning tree of an ordered bipolar directed graph (English)
0 references
27 March 2024
0 references
bipolar directed graph
0 references
spanning tree
0 references
computational complexity
0 references
linear programming
0 references
active bijection
0 references
Tutte polynomial
0 references
0 references
0 references
0 references
0.7937463521957397
0 references
0.7804403901100159
0 references
0.7602116465568542
0 references
0.7415724992752075
0 references
