An algorithm for enumerating all spanning trees of a directed graph
type: Item
instance of: scholarly article
title: An algorithm for enumerating all spanning trees of a directed graph
zbMATH Open document ID: 0951.68117
author: Sanjiv Kapoor
author: H. Ramesh
published in: Algorithmica
publication date: 2000-12-18T00:00:00Z
full work available at URL: 23algorithm27(2)-jun2000.pdf
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 1444106
zbMATH Keywords: spanning trees
zbMATH Keywords: directed graph
MaRDI profile type: Publication
OpenAlex ID: W2090660215
DOI: 10.1007/S004530010008
description: scientific article; zbMATH DE number 1444106