scientific article; zbMATH DE number 1140072

MaRDI QIDQ4385175zbMATH OpenFDO

Authors Madhumangal Pal, G. P. Bhattacharjee

Publication date 3 August 1998

zbMATH Keywords

graphEREW PRAMall-pairs shortest paths

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Recommendations

• Optimal parallel algorithm for shortest-paths problem on interval graphs
• Parallel implementation of shortest paths problem on weighted interval and circular arc graphs
• An optimal algorithm to solve the all-pair shortest path problem on interval graphs
• scientific article; zbMATH DE number 913360

Cited in

(8)

• O(1) QUERY TIME ALGORITHM FOR ALL PAIRS SHORTEST DISTANCES ON INTERVAL GRAPHS
• scientific article; zbMATH DE number 913360 (Why is no real title available?)
• An optimal algorithm to find minimum k-hop dominating set of interval graphs
• Parallel implementation of shortest paths problem on weighted interval and circular arc graphs
• L(2,1)-labeling of interval graphs
• Scheduling algorithm to select optimal programme slots in television channels: a graph theoretic approach
• Optimal parallel algorithm for shortest-paths problem on interval graphs
• An optimal parallel algorithm for solving all-pairs shortest paths problem on circular-arc graphs

This page was built for publication:

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