scientific article; zbMATH DE number 3902710

MaRDI QIDQ3680879zbMATH OpenFDO

Authors V. A. Evstigneev

Publication date 1983

zbMATH Keywords

local algorithmsproblems on graphs

Mathematics Subject Classification ID

Graph theory (05C99) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Local algorithms for graphs
• Limits of local algorithms over sparse random graphs
• Limits of local algorithms over sparse random graphs
• Survey of local algorithms
• What Can be Computed Locally?

Cited in

(15)

• Localization of edges in graph models of two-level algorithms
• On the recognition of families of graphs with local computations
• Neighborhoods in problems of discrete mathematics
• Local algorithms on graphs
• Survey of local algorithms
• Local algorithms for graphs
• scientific article; zbMATH DE number 1802681 (Why is no real title available?)
• scientific article; zbMATH DE number 3853143 (Why is no real title available?)
• Local Graph Exploration and Fast Property Testing
• Towards a Study of Low-Complexity Graphs
• Local-Global Phenomena in Graphs
• scientific article; zbMATH DE number 1047739 (Why is no real title available?)
• Limits of local algorithms over sparse random graphs
• Limits of local algorithms over sparse random graphs
• Node and edge averaged complexities of local graph problems

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 Q3680879)