Ortho-polygon visibility representations of embedded graphs (Q724238): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Computing orthogonal drawings with the minimum number of bends / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-Line Planarity Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On RAC drawings of 1-planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simultaneous visibility representations of plane \(st\)-graphs using L-shapes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a feasible flow in a strongly connected network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulating planar graphs while minimizing the maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: An annotated bibliography on 1-planarity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On partitioning the edges of 1-plane graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: L-visibility drawings of IC-planar graphs / rank
 
Normal rank

Latest revision as of 04:38, 16 July 2024

scientific article; zbMATH DE number 6687303
  • Ortho-Polygon Visibility Representations of Embedded Graphs
Language Label Description Also known as
English
Ortho-polygon visibility representations of embedded graphs
scientific article; zbMATH DE number 6687303
  • Ortho-Polygon Visibility Representations of Embedded Graphs

Statements

Ortho-polygon visibility representations of embedded graphs (English)
0 references
Ortho-Polygon Visibility Representations of Embedded Graphs (English)
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
25 July 2018
0 references
21 February 2017
0 references
visibility representations
0 references
orthogonal polygons
0 references
non-planar graphs
0 references
1-planarity
0 references
testing and drawing algorithms
0 references
0 references
0 references
0 references
0 references
0 references

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references