A note on exact algorithms for vertex ordering problems on graphs (Q692902): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q59567532 / rank | |||
Normal rank | |||
| 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.1007/s00224-011-9312-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2143693959 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:39, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on exact algorithms for vertex ordering problems on graphs |
scientific article |
Statements
A note on exact algorithms for vertex ordering problems on graphs (English)
0 references
6 December 2012
0 references
graphs
0 references
algorithms
0 references
exponential time algorithms
0 references
exact algorithms
0 references
vertex ordering problems
0 references
