A linear algorithm for the cutting center of a tree

DOI10.1016/0020-0190(86)90093-1zbMATH Open0624.68058OpenAlexW2071755021MaRDI QIDQ578919FDOQ578919

Authors: Peter 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

Recommendations

• A self-stabilizing graph algorithm: Finding the cutting center of a tree
• On bounds for the cutting number of a graph
• scientific article; zbMATH DE number 4095237
• On finding fundamental cut sets
• scientific article; zbMATH DE number 2104823

zbMATH Keywords

connected graphlinear algorithmcutting number

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Depth-First Search and Linear Graph Algorithms
• Parallel concepts in graph theory
• The cutting center theorem for trees

Cited In (7)

• A linear algorithm for finding the k‐broadcast center of a tree
• A self-stabilizing graph algorithm: Finding the cutting center of a tree
• Title not available (Why is that?)
• The expected number of pairs of connected nodes: Pair-connected reliability
• Cutting numbers for the forward loop backward hop network
• On bounds for the cutting number of a graph
• INDUCTIVE ALGORITHMS ON FINITE TREES

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q578919)