Heuristic method to check the realisability of a graph into a rectangular plan
From MaRDI portal
Publication:1575024
DOI10.1016/S0965-9978(99)00023-XzbMath0959.68544MaRDI QIDQ1575024
Publication date: 14 August 2000
Published in: Advances in Engineering Software (Search for Journal in Brave)
Related Items (2)
Transformations among rectangular partitions ⋮ A transformation algorithm to construct a rectangular floorplan
This page was built for publication: Heuristic method to check the realisability of a graph into a rectangular plan
