Übersicht			Auf mobile öffnen

Lieferstatus:	i.d.R. innert 5-10 Tagen versandfertig
Veröffentlichung:	Januar 2021
Genre:	Schulbücher
ISBN:	9783958261464
EAN-Code:	9783958261464
Verlag:	Würzburg University Press
Einband:	Kartoniert
Sprache:	English
Dimensionen:	H 240 mm / B 170 mm / D 11 mm
Gewicht:	339 gr
Seiten:	172
Zus. Info:	Paperback
Bewertung:	Titel bewerten / Meinung schreiben

Inhalt:

Constraining graph layouts - that is, restricting the placement of vertices and the routing of edges to obey certain constraints - is common practice in graph drawing. In this book, we discuss algorithmic results on two different restriction types: placing vertices on the outer face and on the integer grid. For the first type, we look into the outer k-planar and outer k-quasi-planar graphs, as well as giving a linear-time algorithm to recognize full and closed outer k-planar graphs Monadic Second-order Logic. For the second type, we consider the problem of transferring a given planar drawing onto the integer grid while perserving the original drawings topology; we also generalize a variant of Cauchy's rigidity theorem for orthogonal polyhedra of genus 0 to those of arbitrary genus.