A CLASS OF GRAPHS WHICH HAS EFFICIENT RANKING AND UNRANKING ALGORITHMS FOR SPANNING TREES AND FORESTS (Q3022025)
From MaRDI portal
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
