A CLASS OF GRAPHS WHICH HAS EFFICIENT RANKING AND UNRANKING ALGORITHMS FOR SPANNING TREES AND FORESTS (Q3022025): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Unranking and ranking spanning trees of a graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Bijections for Cayley trees, spanning trees, and their q-analogues / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4144192 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4552272 / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1142/s0129054104002650 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2037056168 / rank | |||
Normal rank | |||
Latest revision as of 09:25, 30 July 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
