An algorithm for the determination of longest distances in a graph

DOI10.1007/BF01681355zbMath0329.90067MaRDI QIDQ4097107

Hartmut Noltemeier

Publication date: 1975

Published in: Mathematical Programming (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Related Items (1)

An algorithm for finding the nucleolus of assignment games

Uses Software

• Algorithm 97

Cites Work

• A note on two problems in connexion with graphs
• Depth-First Search and Linear Graph Algorithms
• A Note on Dijkstra's Shortest Path Algorithm
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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