Graph Property Update Algorithms and Their Appligation to Distance Matrices

DOI10.1080/03155986.1982.11731860MaRDI QIDQ3967059zbMATH OpenOpenAlexFDO

Authors Grant A. Cheston, Derek G. Corneil

Publication date 1982

Published in INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03155986.1982.11731860

zbMATH Keywords

analysis of algorithmsbreadth-first searchcomputational complexitydistance matrixgraph algorithms

Mathematics Subject Classification ID

Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Algorithms in computer science (68W99)

Cited in

(2)

• On the computational complexity of dynamic graph problems
• Facilities layout generalized model solved by n-boundary shortest path heuristics

This page was built for publication: Graph Property Update Algorithms and Their Appligation to Distance Matrices

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