A parallel algorithm for the enumeration of the spanning trees of a graph
From MaRDI portal
Publication:1058301
DOI10.1016/S0167-8191(84)90197-2zbMath0564.68051OpenAlexW2051184192MaRDI QIDQ1058301
Publication date: 1985
Published in: Parallel Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-8191(84)90197-2
This page was built for publication: A parallel algorithm for the enumeration of the spanning trees of a graph