Localization of edges in graph models of two-level algorithms

DOI10.1007/BF02742281zbMATH Open0966.68159OpenAlexW2072647213MaRDI QIDQ1582914FDOQ1582914

Authors: N. A. Likhoded, P. I. Sobolevskij, A. A. Tiunchik 

Publication date: 16 October 2000

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02742281

Recommendations

• Local algorithms on graphs
• Local algorithms for graphs
• scientific article; zbMATH DE number 3902710
• Local computation algorithms for graphs of non-constant degrees
• Local computations in graphs: the case of cellular edge local computations
• Node and edge averaged complexities of local graph problems
• The role of graph structures in the theory of local elimination algorithms
• Local-edge-connectivity in digraphs and oriented graphs
• Definitions and comparisons of local computations on graphs (extended abstract)
• Local-Global Phenomena in Graphs

zbMATH Keywords

multidimensional computational models

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Cites Work

• Title not available (Why is that?)
• The Organization of Computations for Uniform Recurrence Equations
• Synthesizing linear array algorithms from nested FOR loop algorithms
• Method of constructing parallel forms of algorithms based on locally parallel, globally sequential partition
• Title not available (Why is that?)

Cited In (2)

• Foundations of Software Science and Computation Structures
• Node and edge averaged complexities of local graph problems

This page was built for publication: Localization of edges in graph models of two-level algorithms

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