TU Berlin

FG Kombinatorische Optimierung und Graphenalgorithmen1989

COGA 5-Wheel


zur Navigation

Preprints 1989

A Minmax Facility Location Problem
Zitatschlüssel Report-230-1989
Autor Wictor Piotrowski and Maciej M. Syslo
Jahr 1989
Nummer 230
Institution Technische Universität Berlin, Institut für Mathematik
Zusammenfassung In a previous paper the concept of branch weight centroid has been extended so that it can be defined for an arbitrary finite set $X$ with a distinguished family $\cal C$ of ``convex'' subsets of $X$. In particular the centroid of a graph was defined for $X$ to be the vertex set of $G$ and the chordless path convexity. In this paper, we give necessary and sufficient conditions for a graph to be a centroid of another one as well as of itself. Then, we apply these results to some particular classes of graphs: chordal, Halin, series-parallel and outerplanar.
Typ der Publikation Preprint
Download Bibtex Eintrag



Schnellnavigation zur Seite über Nummerneingabe