Drawings of graphs on surfaces with few crossings (Q1920424): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Farhad Shahrokhi / rank
 
Normal rank
Property / author
 
Property / author: László A. Székely / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multilayer grid embeddings for VLSI / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge crossings in drawings of bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing Number Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing Number is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Approximation Schemes for Convex Programs with Many Blocks and Coupling Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An infinite family of octahedral crossing numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The toroidal crossing number of Km,n / rank
 
Normal rank
Property / cites work
 
Property / cites work: The toroidal crossing number of the complete graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for crossing numbers of graphs with application to \(K_n\),\(K_{pq}\)g, and \(Q(d)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On stable crossing numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Approximation Algorithms For the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: The crossing number of K5,n / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast approximation algorithms for multicommodity flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3724367 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum concurrent flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Canonical Concurrent Flows, Crossing Number and Graph Expansion / rank
 
Normal rank
Property / cites work
 
Property / cites work: The crossing number of a graph on a compact 2-manifold / rank
 
Normal rank
Property / cites work
 
Property / cites work: On crossing numbers of hypercubes and cube connected cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3344220 / rank
 
Normal rank

Latest revision as of 13:06, 24 May 2024

scientific article
Language Label Description Also known as
English
Drawings of graphs on surfaces with few crossings
scientific article

    Statements

    Drawings of graphs on surfaces with few crossings (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    20 October 1996
    0 references
    crossing number
    0 references
    topological graph theory
    0 references
    polynomial-time algorithm
    0 references

    Identifiers