Heuristic approaches to the maximization of the number of spanning trees in regular graphs
From MaRDI portal
Publication:1840930
zbMath0968.05073MaRDI QIDQ1840930
Jarosław Arabas, Jacek M. Wojciechowski, Błaẓej Sawionek
Publication date: 18 September 2001
Published in: Bulletin of the Polish Academy of Sciences. Technical Sciences (Search for Journal in Brave)
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Graph algorithms (graph-theoretic aspects) (05C85) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (1)
This page was built for publication: Heuristic approaches to the maximization of the number of spanning trees in regular graphs
