Drawing slicing graphs with face areas
type: Item
instance of: scholarly article
title: Drawing slicing graphs with face areas
zbMATH Open document ID: 1162.68026
author: Akifumi Kawaguchi
author: Hiroshi Nagamochi
published in: Theoretical Computer Science
publication date: 2009-03-20T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C62
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 5530612
zbMATH Keywords: graph algorithms
zbMATH Keywords: graph drawing
zbMATH Keywords: orthogonal drawing
zbMATH Keywords: plane graphs
zbMATH Keywords: slicing graphs
MaRDI profile type: Publication
full work available at URL: j.tcs.2008.10.038
OpenAlex ID: W2009461451
cites work: On the optimal binary plane partition for sets of isothetic rectangles
cites work: Graph Drawing
cites work: Q3154375
cites work: Q5786239
cites work: Star-Shaped Drawings of Graphs with Fixed Embedding and Concave Corner Constraints
cites work: Graph drawing software
cites work: Q3997942
cites work: Drawing graphs. Methods and models
cites work: Graph-Theoretic Concepts in Computer Science
cites work: Q3154374
cites work: Convex Maps
cites work: Q3216670
cites work: Convex Representations of Graphs
cites work: Floor-Planning by Graph Dualization: 2-Concave Rectilinear Modules
cites work: Sliceable Floorplanning by Graph Dualization
cites work: Bemerkungen zum Vierfarbenproblem
DOI: 10.1016/J.TCS.2008.10.038
description: scientific article; zbMATH DE number 5530612