Efficiently enumerating all spanning trees of a plane 3-tree (extended abstract)

DOI10.1007/978-3-031-30448-4_26OpenAlexW4366958292MaRDI QIDQ6057353

Muhammad Nur Yanhaona, Asswad Sarker Nomaan, Md. Saidur Rahman

Publication date: 4 October 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-30448-4_26

zbMATH Keywords

plane 3-treetime and space complexityspanning tree enumeration

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Unnamed Item
• A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph
• Determinants and current flows in electric networks
• On trees of a graph and their generation
• Point-Set Embeddings of Plane 3-Trees
• Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
• Finding All Spanning Trees of Directed and Undirected Graphs
• Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs
• EFFICIENTLY SCANNING ALL SPANNING TREES OF AN UNDIRECTED GRAPH

This page was built for publication: Efficiently enumerating all spanning trees of a plane 3-tree (extended abstract)