Elias Dahlhaus. Linear time and almost linear time cases for minimal elimination orderings. In Kamiel Cornelissen, Ruben Hoeksma, Johann Hurink, Bodo Manthey, editors, 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Enschede, Netherlands, May 21-23, 2013. Volume WP 13-01 of CTIT Workshop Proceedings, pages 75-78, 2013.
@inproceedings{Dahlhaus13,
title = {Linear time and almost linear time cases for minimal elimination orderings},
author = {Elias Dahlhaus},
year = {2013},
researchr = {https://researchr.org/publication/Dahlhaus13},
cites = {0},
citedby = {0},
pages = {75-78},
booktitle = {12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Enschede, Netherlands, May 21-23, 2013},
editor = {Kamiel Cornelissen and Ruben Hoeksma and Johann Hurink and Bodo Manthey},
volume = {WP 13-01},
series = {CTIT Workshop Proceedings},
}