A CLASS OF GRAPHS WHICH HAS EFFICIENT RANKING AND UNRANKING ALGORITHMS FOR SPANNING TREES AND FORESTS (Q3022025): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claims |
||
| Property / author | |||
| Property / author: Jeffery B. Remmel / rank | |||
| Property / author | |||
| Property / author: S. Gill Williamson / rank | |||
Revision as of 09:42, 20 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A CLASS OF GRAPHS WHICH HAS EFFICIENT RANKING AND UNRANKING ALGORITHMS FOR SPANNING TREES AND FORESTS |
scientific article |
Statements
A CLASS OF GRAPHS WHICH HAS EFFICIENT RANKING AND UNRANKING ALGORITHMS FOR SPANNING TREES AND FORESTS (English)
0 references
22 June 2005
0 references
filtered digraph
0 references
complete bipartite graph
0 references
spanning tree
0 references
spanning forest
0 references
ranking
0 references
unranking
0 references
combinatorial generation
0 references
enumeration
0 references
