An Improved Algorithm for the Metro-Line Crossing Minimization Problem

Nöllenburg, Martin

doi:10.1007/978-3-642-11805-0_36

by Martin Nöllenburg

Reference:

An Improved Algorithm for the Metro-Line Crossing Minimization ProblemMartin NöllenburgGraph Drawing (GD'09) (David Eppstein, Emden R. Gansner, eds.), volume 5849 of LNCS, pages 381–392, 2010, Springer Berlin Heidelberg.

Bibtex Entry:

@inproceedings{n-iamlc-10,
	Author = {Nöllenburg, Martin},
	Booktitle = {Graph Drawing (GD'09)},
	Doi = {10.1007/978-3-642-11805-0_36},
	Editor = {Eppstein, David and Gansner, Emden R.},
	Pages = {381--392},
	Publisher = {Springer Berlin Heidelberg},
	Series = {LNCS},
	Title = {An Improved Algorithm for the Metro-Line Crossing Minimization Problem},
	Volume = {5849},
	Year = {2010},
	}