On-line computation of minimal and maximal length paths

DOI10.1016/0304-3975(92)90267-JzbMath0745.68084WikidataQ61609655 ScholiaQ61609655MaRDI QIDQ1184981

Giuseppe F. Italiano, Umberto Nanni, Giorgio Ausiello, Alberto Marchetti-Spaccamela

Publication date: 28 June 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

maximum length pathminimum length pathsminpath operation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

Hard problems in max-algebra, control theory, hypergraphs and other areas ⋮ Dynamic Approximate All-Pairs Shortest Paths: Breaking the $O(mn)$ Barrier and Derandomization

Cites Work

• Chordality properties on graphs and minimal conceptual connections in semantic data models
• On-line computation of transitive closures of graphs
• Amortized efficiency of a path retrieval data structure
• Fast probabilistic algorithms for Hamiltonian circuits and matchings
• Parallel concepts in graph theory
• On the computational power of pushdown automata
• Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
• Amortized Computational Complexity
• An On-Line Edge-Deletion Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On-line computation of minimal and maximal length paths