Characterizing path-like trees from linear configurations

Assume that we embed the path Pn as a subgraph of a 2-dimensional grid, namely, Pk¿Pl. Given such an embedding, we consider the ordered set of subpaths L1, L2,...,Lm which are maximal straight segments in the embedding, and such that the end of Li is the beginning of Li+1.

Gespeichert in:

Bibliographische Detailangaben
1. Verfasser:	López Masip, Susana Clara
Format:	Text Resource
Sprache:	eng
Schlagworte:	Càlcul de variacions Linear configurations Matemàtiques i estadística Numerical calculations Àrees temàtiques de la UPC
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	Assume that we embed the path Pn as a subgraph of a 2-dimensional grid, namely, Pk¿Pl. Given such an embedding, we consider the ordered set of subpaths L1, L2,...,Lm which are maximal straight segments in the embedding, and such that the end of Li is the beginning of Li+1.