Finding pseudoperipheral nodes in graphs

DOI10.1016/0022-0000(84)90012-6zbMath0546.68046OpenAlexW2013076693WikidataQ58329999 ScholiaQ58329999MaRDI QIDQ797999

Jan K. Pachl

Publication date: 1984

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(84)90012-6

zbMATH Keywords

sparse graphpseudoperipheral nodesSPARSPAKworst case time complexity

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (1)

A new algorithm for finding a pseudoperipheral vertex or the endpoints of a pseudodiameter in a graph

Uses Software

• symrcm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing extremal and approximate distances in graphs having unit cost edges
• An Implementation of a Pseudoperipheral Node Finder

This page was built for publication: Finding pseudoperipheral nodes in graphs