Finding pseudoperipheral nodes in graphs

DOI10.1016/0022-0000(84)90012-6MaRDI QIDQ797999zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Jan 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

pseudoperipheral nodessparse graphSPARSPAKworst case time complexity

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4123315
• scientific article; zbMATH DE number 3972202
• The worst-case time complexity for generating all maximal cliques and computational experiments
• Computing and Combinatorics
• A linear-time algorithm for finding a minimum spanning pseudoforest

Cites work

• An Implementation of a Pseudoperipheral Node Finder
• Computing extremal and approximate distances in graphs having unit cost edges
• scientific article; zbMATH DE number 3816913 (Why is no real title available?)
• scientific article; zbMATH DE number 3688740 (Why is no real title available?)
• scientific article; zbMATH DE number 3449757 (Why is no real title available?)

Cited in

(2)

• A New Algorithm for Finding a Pseudoperipheral Node in a Graph
• A new algorithm for finding a pseudoperipheral vertex or the endpoints of a pseudodiameter in a graph

Describes a project that uses

Uses Software

• symrcm

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

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