Bounded Contractions of Full Trees

Let G be a simple finite connected undirected graph. A contraction φ of G is a mapping from G = G( V, E) to G′ = G′( V′, E′), where G′ is also a simple connected undirected graph, such that if u, ν ∈ V are connected by an edge (adjacent) in G then either φ( u) = φ(ν), or φ( u) and φ(ν) are adjacent...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of parallel and distributed computing 1993, Vol.17 (4), p.363-369
Hauptverfasser:	Barak, Amnon, Ben-Natan, Ron
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied sciences Computer science control theory systems Computer systems and distributed systems. User interface Exact sciences and technology Software
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!