Paths, trees and matchings under disjunctive constraints (Q643009)
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 5964711
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Paths, trees and matchings under disjunctive constraints |
scientific article; zbMATH DE number 5964711 |
Statements
Paths, trees and matchings under disjunctive constraints (English)
0 references
27 October 2011
0 references
minimal spanning tree
0 references
matching
0 references
shortest path
0 references
conflict graph
0 references
binary constraints
0 references
0.920594036579132
0 references
0.8178259134292603
0 references
0.8053398728370667
0 references
0.8021605610847473
0 references
0.8011235594749451
0 references
