Minimum Tree Supports for Hypergraphs and Low-Concurrency Euler Diagrams

Klemz, Boris; Mchedlidze, Tamara; Nöllenburg, Martin

doi:10.1007/978-3-319-08404-6_23

by Boris Klemz, Tamara Mchedlidze, Martin Nöllenburg

Reference:

Minimum Tree Supports for Hypergraphs and Low-Concurrency Euler DiagramsBoris Klemz, Tamara Mchedlidze, Martin NöllenburgAlgorithm Theory (SWAT'14) (R. Ravi, I. L. Gørtz, eds.), volume 8503 of LNCS, pages 253–264, 2014, Springer International Publishing.

Bibtex Entry:

@inproceedings{kmn-mtshled-14,
	Author = {Klemz, Boris and Mchedlidze, Tamara and Nöllenburg, Martin},
	Booktitle = {Algorithm Theory (SWAT'14)},
	Doi = {10.1007/978-3-319-08404-6_23},
	Editor = {Ravi, R. and Gørtz, I. L.},
	Pages = {253--264},
	Publisher = {Springer International Publishing},
	Series = {LNCS},
	Title = {Minimum Tree Supports for Hypergraphs and Low-Concurrency {E}uler Diagrams},
	Volume = {8503},
	Year = {2014},
	}