The segment number: algorithms and universal lower bounds for some classes of planar graphs (Q6039428): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Generating all 3‐connected 4‐regular planar graphs from the octahedron graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of drawing graphs on few lines and few planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing graphs on few lines and few planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawings of planar graphs with few slopes and segments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing plane triangulations with few segments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex drawings of graphs with non-convex boundary constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex drawings of hierarchical planar graphs and clustered planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing Planar Graphs with Few Geometric Primitives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing Planar Cubic 3-Connected Graphs with Few Segments: Algorithms & Experiments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing planar graphs with few segments on a polynomial grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental Analysis of the Accessibility of Drawings with Few Segments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexity-increasing morphs of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Drawings of Hierarchical Graphs in Linear Time, with Applications to Planar Graph Morphing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing Graphs on Few Circles and Few Spheres / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum-segment convex drawings of 3-connected cubic plane graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variants of the segment number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Segment Drawings of Series-Parallel Graphs with the Maximum Degree Three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing Graphs with Few Arcs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3216670 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Representations of Graphs / rank
 
Normal rank

Latest revision as of 01:34, 1 August 2024

scientific article; zbMATH DE number 7682416
Language Label Description Also known as
English
The segment number: algorithms and universal lower bounds for some classes of planar graphs
scientific article; zbMATH DE number 7682416

    Statements

    The segment number: algorithms and universal lower bounds for some classes of planar graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    5 May 2023
    0 references
    visual complexity
    0 references
    segment number
    0 references
    lower/upper bounds
    0 references

    Identifiers