The influence of random number generators on graph partitioning algorithms

zbMATH Open1112.68107MaRDI QIDQ871158FDOQ871158

Authors: Ulrich Elsner 

Publication date: 16 March 2007

Published in: ETNA - Electronic Transactions on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/127465

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• scientific article; zbMATH DE number 3855167
• scientific article; zbMATH DE number 3855168
• On the Use of Randomness in Local Distributed Graph Algorithms
• scientific article; zbMATH DE number 1241383
• Randomized methods for the number partitioning problem
• About randomised distributed graph colouring and graph partition algorithms
• Randomization for efficient dynamic graph algorithms (invited talk)
• scientific article; zbMATH DE number 4094840
• scientific article; zbMATH DE number 2019628

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Uses Software

• MESHPART

This page was built for publication: The influence of random number generators on graph partitioning algorithms

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