An algorithm for the determination of longest distances in a graph

DOI10.1007/BF01681355MaRDI QIDQ4097107zbMATH OpenFDO

Authors Hartmut Noltemeier

Publication date 1975

Published in Mathematical Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01681355

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Programming involving graphs or networks (90C35)

Cites work

• A Note on Dijkstra's Shortest Path Algorithm
• A note on two problems in connexion with graphs
• Depth-First Search and Linear Graph Algorithms
• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• scientific article; zbMATH DE number 3464839 (Why is no real title available?)
• scientific article; zbMATH DE number 3302126 (Why is no real title available?)
• scientific article; zbMATH DE number 3360188 (Why is no real title available?)

Cited in

(2)

• An algorithm for finding the nucleolus of assignment games
• Nucleolus computation for some structured TU games via graph theory and linear algebra

Describes a project that uses

Uses Software

• Algorithm 97

This page was built for publication: An algorithm for the determination of longest distances in a graph

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