The Crossing Number of Graphs: Theory and Computation (Q3644730): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On the crossing number of complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A framework for solving VLSI graph layout problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some provably hard crossing number problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New results on rectilinear crossing numbers and plane embeddings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for rectilinear crossing numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut approach to the crossing number problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing and Weighted Crossing Number of Near-Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Approach to Exact Crossing Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex insertion approximates the crossing number of apex graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds for planar \(k\)-sets and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of sums and products / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximations of Crossings in Graph Drawings and VLSI Layout Areas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inserting an edge into a planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5587734 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Crossing Number of Almost Planar Graphs / 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, pair-crossing number, and expansion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which crossing number is it anyway? / rank
 
Normal rank
Property / cites work
 
Property / cites work: The crossing number of <i>K</i><sub>11</sub> is 100 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Removing Even Crossings on Surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Odd crossing number and crossing number are not the same / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Rectilinear Crossing Number of a Complete Graph and Sylvester's "Four Point Problem" of Geometric Probability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5186278 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A successful concept for measuring non-planarity of graphs: The crossing number. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward a theory of crossing numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a problem of P. Turan concerning graphs / rank
 
Normal rank

Revision as of 03:31, 2 July 2024

scientific article
Language Label Description Also known as
English
The Crossing Number of Graphs: Theory and Computation
scientific article

    Statements

    The Crossing Number of Graphs: Theory and Computation (English)
    0 references
    0 references
    12 November 2009
    0 references
    survey article
    0 references
    crossing number of graphs
    0 references
    computational geometry
    0 references
    rectilinear crossing number
    0 references
    approximations
    0 references
    exact computations
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references