A Graph Partitioning Scheme and Applications to Fault Tolerant Computing

This paper presents a method for finding a partition of a graph that can be applied to many problems related to fault-tolerant computing. The applications range from computer networks to distributed software design. All applications have in common that specific nodes should be selected for the placement of entities such as servers or objects. The method is based on the well known Cut Trees and centrality concepts on graphs. ledgements d like to express my gratitude to Elias P. Duarte Jr. for constantly motivating my research and for all valuable advice.