Efficient algorithms to solve the link-orientation problem for multi-square, convex-bipartite, and convex-split networks (Q2568262): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ins.2004.11.008 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2031738458 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Polynomial auction algorithms for shortest paths / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3619797 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A reflective infrastructure for workflow adaptability / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3328583 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Algorithms for a Core and k-Tree Core of a Tree / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4493045 / rank | |||
Normal rank | |||
Latest revision as of 16:16, 10 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient algorithms to solve the link-orientation problem for multi-square, convex-bipartite, and convex-split networks |
scientific article |
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
