Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Centering a spanning tree of a biconnected graph

From MaRDI portal
Publication:1123632
Jump to:navigation, search

DOI10.1016/0020-0190(89)90051-3zbMath0677.68075OpenAlexW1966734270MaRDI QIDQ1123632

Andrzej Proskurowski, Grant A. Cheston, Art Farley, Stephen T. Hedetniemi

Publication date: 1989

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(89)90051-3


zbMATH Keywords

centerbiconnected graphspanning tree algorithm


Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)


Related Items

A linear algorithm for centering a spanning tree of a biconnected graph ⋮ Unnamed Item ⋮ An efficient distributed algorithm for centering a spanning tree of a biconnected graph



Cites Work

  • Some properties of a centroid of a free tree
  • Parallel concepts in graph theory
  • Unnamed Item
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1123632&oldid=13178121"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 04:18.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki