Pivot Gray codes for the spanning trees of a graph ft. the fan
From MaRDI portal
Publication:6580496
DOI10.1007/S00373-024-02808-2zbMATH Open1544.05105MaRDI QIDQ6580496
Aaron Grubb, Ben Cameron, Joe Sawada
Publication date: 29 July 2024
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial codes (94B25)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees
- An algorithm for the enumeration of spanning trees
- A flexible algorithm for generating all the spanning trees in undirected graphs
- Über Stromverzweigung in netzförmigen Leitern.
- Reverse search for enumeration
- An algorithm for enumerating all spanning trees of a directed graph
- Gray code enumeration of plane straight-line graphs
- On trees of a graph and their generation
- A pivot Gray code listing for the spanning trees of the fan graph
- The Greedy Gray Code Algorithm
- Finding All Spanning Trees of Directed and Undirected Graphs
- An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs
- Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs
- Two Algorithms for Unranking Arborescences
- Combinatorial generation via permutation languages
- EFFICIENTLY SCANNING ALL SPANNING TREES OF AN UNDIRECTED GRAPH
- On the Tree Graph of a Matroid
- Fast enumeration algorithms for non-crossing geometric graphs
- Combinatorial generation via permutation languages. III: Rectangulations
- All your bases are belong to us: listing all bases of a matroid by greedy exchanges
- New bounds for matrix multiplication: from alpha to omega
This page was built for publication: Pivot Gray codes for the spanning trees of a graph ft. the fan
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6580496)
