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

From MaRDI portal
Revision as of 16:15, 25 April 2024 by Import240425040427 (talk | contribs) (Added link to MaRDI item.)
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