Crossing number and weighted crossing number of near-planar graphs (Q548655): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q17 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C62 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 5915197 / rank
 
Normal rank
Property / zbMATH Keywords
 
crossing number
Property / zbMATH Keywords: crossing number / rank
 
Normal rank
Property / zbMATH Keywords
 
near-planar
Property / zbMATH Keywords: near-planar / rank
 
Normal rank
Property / zbMATH Keywords
 
almost planar
Property / zbMATH Keywords: almost planar / rank
 
Normal rank
Property / zbMATH Keywords
 
planar separation
Property / zbMATH Keywords: planar separation / rank
 
Normal rank
Property / zbMATH Keywords
 
dual distance
Property / zbMATH Keywords: dual distance / rank
 
Normal rank
Property / zbMATH Keywords
 
facial distance
Property / zbMATH Keywords: facial distance / rank
 
Normal rank
Property / zbMATH Keywords
 
NP-hardness
Property / zbMATH Keywords: NP-hardness / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00453-009-9357-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2010561968 / 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: On the number of sums and products / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing Number is NP-Complete / 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: On the Crossing Number of Almost Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dividing a Graph into Triconnected Components / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2702747 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planarizing Graphs - A Survey and Annotated Bibliography / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for finding an ambitus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3418609 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2726740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4879104 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4352316 / 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: A successful concept for measuring non-planarity of graphs: The crossing number. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5393666 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separation of vertices by a circuit / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 06:30, 4 July 2024

scientific article
Language Label Description Also known as
English
Crossing number and weighted crossing number of near-planar graphs
scientific article

    Statements

    Crossing number and weighted crossing number of near-planar graphs (English)
    0 references
    0 references
    0 references
    0 references
    30 June 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    crossing number
    0 references
    near-planar
    0 references
    almost planar
    0 references
    planar separation
    0 references
    dual distance
    0 references
    facial distance
    0 references
    NP-hardness
    0 references
    0 references