Efficient algorithms to solve the link-orientation problem for multi-square, convex-bipartite, and convex-split networks (Q2568262)
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: Efficient algorithms to solve the link-orientation problem for multi-square, convex-bipartite, and convex-split networks |
scientific article; zbMATH DE number 2212986
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient algorithms to solve the link-orientation problem for multi-square, convex-bipartite, and convex-split networks |
scientific article; zbMATH DE number 2212986 |
Statements
Efficient algorithms to solve the link-orientation problem for multi-square, convex-bipartite, and convex-split networks (English)
0 references
10 October 2005
0 references
Undirected network
0 references
Directed network
0 references
LOP
0 references
WFQ
0 references
Convex-bipartite networks
0 references
Convex-split networks
0 references
0.86810565
0 references
0.85815865
0 references
0.84522843
0 references
0.84341997
0 references
0.84341997
0 references
0.84058404
0 references
0.83742213
0 references
0.8374221
0 references
0.8364897
0 references
