Two Algorithms for Unranking Arborescences (Q4876694): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1006/jagm.1996.0014 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2062877152 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 19:53, 19 March 2024
scientific article; zbMATH DE number 874102
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two Algorithms for Unranking Arborescences |
scientific article; zbMATH DE number 874102 |
Statements
Two Algorithms for Unranking Arborescences (English)
0 references
4 June 1996
0 references
rooted spanning arborescences
0 references
directed graph
0 references
