Vertex ordering with optimal number of adjacent predecessors (Q5130732): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| label / en | label / en | ||
Vertex ordering with optimal number of adjacent predecessors | |||
| 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://hal.science/hal-02025298 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3013102369 / rank | |||
Normal rank | |||
| Property / title | |||
Vertex ordering with optimal number of adjacent predecessors (English) | |||
| Property / title: Vertex ordering with optimal number of adjacent predecessors (English) / rank | |||
Normal rank | |||
Latest revision as of 09:04, 30 July 2024
scientific article; zbMATH DE number 7268101
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Vertex ordering with optimal number of adjacent predecessors |
scientific article; zbMATH DE number 7268101 |
Statements
28 October 2020
0 references
vertex ordering
0 references
distance geometry problem
0 references
discretization order
0 references
complexity analysis
0 references
Vertex ordering with optimal number of adjacent predecessors (English)
0 references
