Easy and hard instances of arc ranking in directed graphs (Q2462400): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.dam.2007.07.013 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2006231483 / rank | |||
Normal rank | |||
Revision as of 00:11, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Easy and hard instances of arc ranking in directed graphs |
scientific article |
Statements
Easy and hard instances of arc ranking in directed graphs (English)
0 references
30 November 2007
0 references
graph ranking
0 references
digraph
0 references
computational complexity
0 references
caterpillar
0 references
