Rectangle-visibility representations of bipartite graphs (Q1363757): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: reviewed by (P1447): Item:Q585164 |
||
Property / reviewed by | |||
Property / reviewed by: Bal Kishan Dass / rank | |||
Revision as of 11:57, 17 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Rectangle-visibility representations of bipartite graphs |
scientific article |
Statements
Rectangle-visibility representations of bipartite graphs (English)
0 references
11 August 1997
0 references
This paper considers rectangle-visibility graphs, where adjacencies among rectangles in the plane are determined by horizontal and vertical visibility. Such graphs have application to VLSI design and have been considered in connection with circuit board design. Those complete bipartite graphs that can be so represented in general and when rectangles are not allowed to have collinear sides have been characterized. An upper bound on the number of edges of any bipartite rectangle-visibility graph has also been derived.
0 references
rectangle-visibility graphs
0 references
VLSI design
0 references
complete bipartite graphs
0 references