The terminal-pairability problem in complete bipartite graphs (Q2659062)
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 7327701
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The terminal-pairability problem in complete bipartite graphs |
scientific article; zbMATH DE number 7327701 |
Statements
The terminal-pairability problem in complete bipartite graphs (English)
0 references
25 March 2021
0 references
terminal-pairability
0 references
demand graph
0 references
bipartite graph
0 references
0.9570926427841188
0 references
0.9002275466918945
0 references
0.8900708556175232
0 references
0.8694095611572266
0 references
0.7982398271560669
0 references
