Crossing Number of Graphs with Rotation Systems (Q5452204): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
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/978-3-540-77537-9_3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1599261767 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4484775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3576673 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bimodal Crossing Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4153936 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing Number is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing number is hard for cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Extension of the String-to-String Correction Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a cyclic string-to-string correction problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3576669 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Drawing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Removing Independently Even Crossings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133128 / rank
 
Normal rank

Latest revision as of 19:58, 27 June 2024

scientific article; zbMATH DE number 5252808
Language Label Description Also known as
English
Crossing Number of Graphs with Rotation Systems
scientific article; zbMATH DE number 5252808

    Statements

    Crossing Number of Graphs with Rotation Systems (English)
    0 references
    0 references
    0 references
    0 references
    25 March 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    crossing number
    0 references
    computational complexity
    0 references
    computational geometry
    0 references
    0 references