Graph-Theoretic Concepts in Computer Science
From MaRDI portal
Publication:5902522
DOI10.1007/b93953zbMath1255.05148MaRDI QIDQ5902522
Publication date: 12 January 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (5)
Computing straight-line 3D grid drawings of graphs in linear volume ⋮ Area-efficient planar straight-line drawings of outerplanar graphs ⋮ Curve-constrained drawings of planar graphs ⋮ Queue layouts of planar 3-trees ⋮ Queue layouts of planar 3-trees
This page was built for publication: Graph-Theoretic Concepts in Computer Science
