Approximating the range sum of a graph on CREW PRAM

DOI10.1007/3-540-36385-8_31MaRDI QIDQ4414617zbMATH OpenFDO

Authors P. Gupta, Saurabh Srivastava

Publication date 25 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2571/25710312.htm

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computing methodologies and applications (68U99) Parallel algorithms in computer science (68W10) Approximation algorithms (68W25)

Recommendations

• scientific article; zbMATH DE number 622027
• On optimum summable graphs
• scientific article; zbMATH DE number 861344
• scientific article; zbMATH DE number 841593
• On approximating the \(d\)-girth of a graph
• On Approximating the d-Girth of a Graph
• scientific article; zbMATH DE number 4148140
• Some results on sum graphs
• On the sum of all distances in composite graphs
• scientific article; zbMATH DE number 4070353

This page was built for publication: Approximating the range sum of a graph on CREW PRAM

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