Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Parallelism detection using graph labelling

From MaRDI portal
Publication:2688511
Jump to:navigation, search

DOI10.1134/S199508022213042XMaRDI QIDQ2688511FDOQ2688511


Authors: P. N. Telegin, A. V. Baranov, B. M. Shabanov, A. I. Tikhomirov Edit this on Wikidata


Publication date: 3 March 2023

Published in: Lobachevskii Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2212.04818





zbMATH Keywords

parallel programminggraph labellingprogram parallelizationgraph wave algorithm


Mathematics Subject Classification ID

Statistical mechanics, structure of matter (82-XX)


Cites Work

  • An effective heuristic clustering algorithm for mining multiple critical nodes in complex networks


Cited In (1)

  • Impact of Parallel Code Optimization on Computer Power Consumption

Uses Software

  • Cetus





This page was built for publication: Parallelism detection using graph labelling

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2688511&oldid=15523528"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 3 February 2024, at 10:56. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki