Graph coloring using peer-to-peer networks

MaRDI QIDQ2370552zbMATH OpenFDO

Authors Adrian Iftene, Cornelius Croitoru

Publication date 26 June 2007

Published in Computer Science Journal of Moldova (Search for Journal in Brave)

Full work available at URL http://www.math.md/files/csjm/v14-n3/v14-n3-(pp366-380).pdf

zbMATH Keywords

content addressable network model

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Network design and communication in computer systems (68M10)

Recommendations

• A fully distributed Lagrangean solution for a peer-to-peer overlay network design problem
• Overlay architectures for file distribution: Fundamental performance analysis for homogeneous and heterogeneous cases
• A framework for scalable greedy coloring on distributed-memory parallel computers
• scientific article; zbMATH DE number 956854
• Simple decentralized graph coloring

This page was built for publication: Graph coloring using peer-to-peer networks

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