High Performance Computing - HiPC 2003

DOI10.1007/B94479zbMath1215.68270OpenAlexW2609127897MaRDI QIDQ5193153

David P. Jacobs, Stephen T. Hedetniemi, Pradip K. Srimani, Wayne Goddard

Publication date: 11 August 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b94479

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Related Items (3)

Efficient self-stabilizing algorithms for minimal total \(k\)-dominating sets in graphs ⋮ A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs ⋮ Self-Stabilizing Domination Algorithms

This page was built for publication: High Performance Computing - HiPC 2003