A linear algorithm for centering a spanning tree of a biconnected graph
type: Item
instance of: scholarly article
title: A linear algorithm for centering a spanning tree of a biconnected graph
zbMATH Open document ID: 0799.68144
DOI: 10.1016/0020-0190(94)00066-2
author: K. S. Easwarakumar
author: C. Pandu Rangan
author: Grant A. Cheston
published in: Information Processing Letters
publication date: 2000-11-30T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 633504
zbMATH Keywords: \(st\)-numbering
zbMATH Keywords: linear-time algorithm
zbMATH Keywords: spanning tree
zbMATH Keywords: biconnected graph
zbMATH Keywords: center
MaRDI profile type: Publication
full work available at URL: 0020-0190(94)00066-2
OpenAlex ID: W1978594916
cites work: Centering a spanning tree of a biconnected graph
cites work: Q3883524
cites work: Computing an st-numbering
cites work: Q5585020
description: scientific article; zbMATH DE number 633504