How to draw a planar clustered graph (Q6064010): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/bfb0030816 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Algorithms for drawing graphs: An annotated bibliography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Area requirement and symmetry display of planar upward drawings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993087 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planarity for clustered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing Graphs in the Plane with High Resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230331 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Nested Dissection / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Angular Resolution of Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Draw a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4024020 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/BFB0030816 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:05, 30 December 2024

scientific article; zbMATH DE number 7776428
Language Label Description Also known as
English
How to draw a planar clustered graph
scientific article; zbMATH DE number 7776428

    Statements

    Identifiers