A graph partition problem

DOI10.1007/BF02029067zbMath0890.05058MaRDI QIDQ1367109

Bruno Simeone, Aurora Morgana, Yanpei Liu

Publication date: 29 June 1998

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

zbMATH Keywords

partition

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (3)

Orthogonal drawings of graphs for the automation of VLSI circuit design ⋮ Transportation networks: Old and new ⋮ Boolean approaches to graph embeddings related to VLSI

Cites Work

• General theoretical results on rectilinear embeddability of graphs
• A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid

This page was built for publication: A graph partition problem