Decomposable trees: a polynomial algorithm for tripodes

In this article, we deal with graphs modelling interconnection networks of parallel systems (parallel computers, networks of workstations, etc.). We want to share the nodes of such a network between many users, each one needing a given number of nodes. Thus, a graph G with N vertices is said to be d...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Discrete Applied Mathematics 2002-07, Vol.119 (3), p.205-216
Hauptverfasser:	Barth, D., Baudon, O., Puech, J.
Format:	Artikel
Sprache:	eng
Schlagworte:	Combinatorics Combinatorics. Ordered structures Computer Science Exact sciences and technology Graph decomposition Graph theory Integer decomposition Mathematics Network sharing Other Parallel systems Polynomial algorithm Sciences and techniques of general use Tripodes
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!