Pages that link to "Item:Q3824326"
From MaRDI portal
The following pages link to A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graph (Q3824326):
Displaying 22 items.
- Improved floor-planning of graphs via adjacency-preserving transformations (Q411253) (← links)
- On rectangular cartograms (Q883236) (← links)
- A theory of rectangular dual graphs (Q923112) (← links)
- Simple and efficient floor-planning (Q1007584) (← links)
- On rectilinear duals for vertex-weighted plane graphs (Q1011760) (← links)
- A linear algorithm to find a rectangular dual of a planar triangulated graph (Q1097704) (← links)
- Floorplanning by graph dualization: \(L\)-shaped modules (Q1310461) (← links)
- Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems (Q1392021) (← links)
- Heuristic method to check the realisability of a graph into a rectangular plan (Q1575024) (← links)
- An efficient parallel algorithm for finding rectangular duals of plane triangular graphs (Q1892581) (← links)
- A transformation algorithm to construct a rectangular floorplan (Q2031052) (← links)
- A theory of L-shaped floor-plans (Q2110365) (← links)
- Drawings of planar graphs with few slopes and segments (Q2385699) (← links)
- Towards Characterizing Graphs with a Sliceable Rectangular Dual (Q2959780) (← links)
- Rectangular duals of planar graphs (Q3710557) (← links)
- Transformations among rectangular partitions (Q5046001) (← links)
- On triangulating planar graphs under the four-connectivity constraint (Q5056168) (← links)
- ALL SEPARATING TRIANGLES IN A PLANE GRAPH CAN BE OPTIMALLY "BROKEN" IN POLYNOMIAL TIME (Q5249048) (← links)
- (Q6150926) (← links)
- A graph theoretic approach for generating \(T\)-shaped floor plans (Q6590090) (← links)
- Construction of floorplans for plane graphs over polygonal boundaries (Q6646742) (← links)
- Efficient enumeration of transversal edge-partitions (Q6657235) (← links)
