Complexities of some interesting problems on spanning trees
type: Item
instance of: scholarly article
title: Complexities of some interesting problems on spanning trees
zbMATH Open document ID: 1182.68090
author: M. Sohel Rahman
author: Mohammad Kaykobad
published in: Information Processing Letters
publication date: 2009-12-04T00:00:00Z
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68R05
zbMATH DE Number: 5642324
zbMATH Keywords: computational complexity
zbMATH Keywords: decision problem
zbMATH Keywords: graphs
zbMATH Keywords: NP-completeness
zbMATH Keywords: spanning trees
zbMATH Keywords: combinatorial problems
MaRDI profile type: Publication
full work available at URL: j.ipl.2004.12.016
OpenAlex ID: W2059123237
cites work: Self-stabilizing systems in spite of distributed control
cites work: Q4198056
cites work: On Representatives of Subsets
cites work: Constructing full spanning trees for cubic graphs
DOI: 10.1016/J.IPL.2004.12.016
description: scientific article; zbMATH DE number 5642324