An efficient orthogonal grid drawing algorithm for cubic graphs (Q6064011): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bfb0030817 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1601492549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Wide-Angle Pair Production and Quantum Electrodynamics at Small Distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spirality of orthogonal representations and optimal drawings of series-parallel graphs and 3-planar graphs (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing planar graphs using the canonical ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: At most single-bend embeddings of cubic graphs / rank
 
Normal rank

Latest revision as of 13:13, 21 August 2024

scientific article; zbMATH DE number 7776429
Language Label Description Also known as
English
An efficient orthogonal grid drawing algorithm for cubic graphs
scientific article; zbMATH DE number 7776429

    Statements