Variable-priority queue and doughnut routing

DOI10.1016/0196-6774(92)90059-LMaRDI QIDQ4015273zbMATH OpenFDO

Authors Hitoshi Suzuki, Akira Ishiguro, Takao Nishizeki

Publication date 12 January 1993

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-6774(92)90059-L

zbMATH Keywords

doughnut-shaped gridedge-disjoint pathsminimum keymulticommodity flows in cyclesterminal pairsvariable-priority queue

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Data structures (68P05) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• On RAM Priority Queues
• A parallel priority queue with constant time operations
• A priority queue for the all pairs shortest path problem
• scientific article; zbMATH DE number 871900
• Two-Level Heaps: A New Priority Queue Structure with Applications to the Single Source Shortest Path Problem

Cited in

(2)

• Algorithms for routing around a rectangle
• Multicommodity flows in cycle graphs

This page was built for publication: Variable-priority queue and doughnut routing

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