Local algorithms on graphs

MaRDI QIDQ2834887zbMATH OpenFDO

Authors V. G. Skobelev

Publication date 25 November 2016

Full work available at URL http://www.iamm.su/en/books/b2054/

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 3902710
• scientific article; zbMATH DE number 194946
• scientific article; zbMATH DE number 52226
• Local algorithms for graphs
• scientific article; zbMATH DE number 3988689

Cited in

(6)

• An efficient algorithm to recognize locally equivalent graphs
• Localization of edges in graph models of two-level algorithms
• On the recognition of families of graphs with local computations
• On a local similarity of graphs
• Local Graph Exploration and Fast Property Testing
• Node and edge averaged complexities of local graph problems

This page was built for publication: Local algorithms on graphs

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