A linear algorithm for the cutting center of a tree

DOI10.1016/0020-0190(86)90093-1zbMath0624.68058OpenAlexW2071755021MaRDI QIDQ578919

Peter J. Slater, Frank Harary

Publication date: 1986

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

Full work available at URL: http://hdl.handle.net/2027.42/25975

zbMATH Keywords

connected graphlinear algorithmcutting number

Mathematics Subject Classification ID

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

Related Items (5)

On bounds for the cutting number of a graph ⋮ INDUCTIVE ALGORITHMS ON FINITE TREES ⋮ A self-stabilizing graph algorithm: Finding the cutting center of a tree ⋮ The expected number of pairs of connected nodes: Pair-connected reliability ⋮ Cutting numbers for the forward loop backward hop network

Cites Work

• Parallel concepts in graph theory
• The cutting center theorem for trees
• Depth-First Search and Linear Graph Algorithms
• Unnamed Item

This page was built for publication: A linear algorithm for the cutting center of a tree