{"product_id":"andre-loffler-constrained-graph-layouts-9783958261464","title":"Constrained Graph Layouts","description":"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.","brand":"Würzburg University Press","offers":[{"title":"Default Title","offer_id":54740003455318,"sku":null,"price":0.0,"currency_code":"EUR","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0925\/5829\/5382\/files\/product_image_9783958261464_1.jpg?v=1794874489","url":"https:\/\/www.momoxbooks.com\/products\/andre-loffler-constrained-graph-layouts-9783958261464","provider":"momox","version":"1.0","type":"link"}