Minimum-cost strong network orientation problems: Classification, complexity, and algorithms (Q4540090): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| label / en | label / en | ||
Minimum-cost strong network orientation problems: Classification, complexity, and algorithms | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199901)33:1<57::aid-net4>3.0.co;2-r / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1967545106 / rank | |||
Normal rank | |||
| Property / title | |||
Minimum-cost strong network orientation problems: Classification, complexity, and algorithms (English) | |||
| Property / title: Minimum-cost strong network orientation problems: Classification, complexity, and algorithms (English) / rank | |||
Normal rank | |||
Latest revision as of 10:36, 30 July 2024
scientific article; zbMATH DE number 1769333
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimum-cost strong network orientation problems: Classification, complexity, and algorithms |
scientific article; zbMATH DE number 1769333 |
Statements
21 July 2002
0 references
0 references
Minimum-cost strong network orientation problems: Classification, complexity, and algorithms (English)
0 references
