Floorplanning by graph dualization: \(L\)-shaped modules (Q1310461): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graph
+Normal rank
@@ Property / cites work @@
+A linear algorithm to find a rectangular dual of a planar triangulated graph
+Normal rank
@@ Property / cites work @@
+On the number of cycles of lengthk in a maximal planar graph
+Normal rank
@@ Property / cites work @@
+Finding a Minimum Circuit in a Graph
@@ Property / cites work: Finding a Minimum Circuit in a Graph / rank @@
+Normal rank
@@ Property / cites work @@
+Rectangular duals of planar graphs
@@ Property / cites work: Rectangular duals of planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Rectangular dualization and rectangular dissections
+Normal rank
@@ Property / cites work @@
+Floorplan design of VLSI circuits
@@ Property / cites work: Floorplan design of VLSI circuits / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf01891831
+Normal rank
@@ Property / OpenAlex ID @@
+W3163653332
@@ Property / OpenAlex ID: W3163653332 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1310461