A decomposition algorithm for locating a shortest path between two nodes in a network

DOI10.1002/NET.3230120207zbMATH Open0484.68050OpenAlexW2170593392MaRDI QIDQ3944019FDOQ3944019

Authors: John J. Jarvis, Suleyman Tufekci 

Publication date: 1982

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230120207

zbMATH Keywords

directed cyclesarbitrary arc distances

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Paths and cycles (05C38) Applications of graph theory to circuits and networks (94C15)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: A decomposition algorithm for locating a shortest path between two nodes in a network

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