{"product_id":"constrained-graph-layouts","title":"Constrained Graph Layouts","description":"\u003cp\u003eConstraining graph layouts - that is, restricting the placement of vertices and the routing of edges to obey certain constraints - is common practice in graph drawing.\u003c\/p\u003e\u003cp\u003eIn this book, we discuss algorithmic results on two different restriction types: placing vertices on the outer face and on the integer grid.\u003c\/p\u003e\u003cp\u003eFor 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.\u003c\/p\u003e\u003cp\u003eFor 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.\u003c\/p\u003e","brand":"Würzburg University Press","offers":[{"title":"Default Title","offer_id":53511896039791,"sku":"9783958261464","price":285.08,"currency_code":"BRL","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0921\/9384\/9711\/files\/3958261469.jpg?v=1790034470","url":"https:\/\/internacional.umlivro.com.br\/products\/constrained-graph-layouts","provider":"UmLivro Internacional","version":"1.0","type":"link"}