Crossing number and weighted crossing number of near-planar graphs
type: Item
instance of: scholarly article
title: Crossing number and weighted crossing number of near-planar graphs
zbMATH Open document ID: 1218.68083
author: S. Cabello
author: Bojan Mohar
published in: Algorithmica
publication date: 2011-06-30T00:00:00Z
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C62
zbMATH DE Number: 5915197
zbMATH Keywords: crossing number
zbMATH Keywords: near-planar
zbMATH Keywords: almost planar
zbMATH Keywords: planar separation
zbMATH Keywords: dual distance
zbMATH Keywords: facial distance
zbMATH Keywords: NP-hardness
MaRDI profile type: Publication
full work available at URL: s00453-009-9357-5
OpenAlex ID: W2010561968
cites work: A framework for solving VLSI graph layout problems
cites work: On the number of sums and products
cites work: Q4198056
cites work: Crossing Number is NP-Complete
cites work: Inserting an edge into a planar graph
cites work: On the Crossing Number of Almost Planar Graphs
cites work: Dividing a Graph into Triconnected Components
cites work: Elimination of local bridges
cites work: Planarizing graphs---a survey and annotated bibliography
cites work: A linear-time algorithm for finding an ambitus
cites work: Q3418609
cites work: Graphs on surfaces
cites work: Q4879104
cites work: Q4352316
cites work: ON THE NUMBER OF SUMS AND PRODUCTS
cites work: A successful concept for measuring non-planarity of graphs: The crossing number.
cites work: Q5393666
cites work: Separation of vertices by a circuit
DOI: 10.1007/S00453-009-9357-5
description: scientific article; zbMATH DE number 5915197