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

From MaRDI portal
Page on [mardi] deleted: Publication:724238
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
aliases / en / 0aliases / en / 0
 
Ortho-Polygon Visibility Representations of Embedded Graphs
description / endescription / en
 
scientific article; zbMATH DE number 6687303
Property / title
 
Ortho-Polygon Visibility Representations of Embedded Graphs (English)
Property / title: Ortho-Polygon Visibility Representations of Embedded Graphs (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1390.68497 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-319-50106-2_22 / rank
 
Normal rank
Property / published in
 
Property / published in: Lecture Notes in Computer Science / rank
 
Normal rank
Property / publication date
 
21 February 2017
Timestamp+2017-02-21T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 21 February 2017 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6687303 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2964311205 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on 1-planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Straight-Line Grid Drawings of 3-Connected 1-Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal Layout with Optimal Face Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Complexity of 1-Planarity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3132853 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 1-Visibility Representations of 1-Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adding One Edge to Planar Graphs Makes Crossing Number and 1-Planarity Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerated Bend Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On drawings and decompositions of 1-planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rectangle-visibility representations of bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3154375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representing a planar graph by vertical lines joining different levels / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Right angle crossing graphs and 1-planarity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bar 1-Visibility Graphs and their relation to other Nearly Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On representations of some thickness-two graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Area requirement of visibility representations of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rectilinear planar layouts and bipolar orientations of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138887 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4418634 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Re-embeddings of Maximum 1-Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Embedding a Graph in the Grid with the Minimum Number of Bends / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to visibility representations of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3216670 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rectilinear drawings of graphs / rank
 
Normal rank
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
links / mardi / namelinks / mardi / name
 

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