Edge crossings in drawings of bipartite graphs
type: Item
instance of: scholarly article
title: Edge crossings in drawings of bipartite graphs
zbMATH Open document ID: 0804.68107
DOI: 10.1007/BF01187020
author: Peter Eades
author: Nicholas Wormald
published in: Algorithmica
publication date: 1994-05-05T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 563270
zbMATH Keywords: directed graph
zbMATH Keywords: edge crossing
zbMATH Keywords: drawing algorithms
zbMATH Keywords: bipartite graph
zbMATH Keywords: median
Wikidata QID: Q56621900
MaRDI profile type: Publication
cites work: Q4091421
cites work: Q3785966
cites work: Q3138899
cites work: Q3097395
cites work: Q3731621
cites work: Q3985344
cites work: Algorithms for drawing graphs: An annotated bibliography
cites work: Q4198056
cites work: Crossing Number is NP-Complete
cites work: DAG—a program that draws directed graphs
cites work: Fundamentals of planar ordered sets
cites work: An Analysis of Several Heuristics for the Traveling Salesman Problem
cites work: Q4014632
cites work: Crossing Theory and Hierarchy Mapping
full work available at URL: https://doi.org/10.1007/bf01187020
OpenAlex ID: W1972151695
DBLP publication ID: journals/algorithmica/EadesW94
description: scientific article; zbMATH DE number 563270