Christian Laforest, Arthur L. Liestman, Thomas C. Shermer, Dominique Sotteau. Edge Disjoint Graph Spanners of Complete Graphs and Complete Digraphs. In HICSS (3). pages 191-199, 1997. [doi]
@inproceedings{LaforestLSS97,
title = {Edge Disjoint Graph Spanners of Complete Graphs and Complete Digraphs},
author = {Christian Laforest and Arthur L. Liestman and Thomas C. Shermer and Dominique Sotteau},
year = {1997},
url = {http://csdl.computer.org/comp/proceedings/hicss/1997/7734/01/7734010191abs.htm},
tags = {completeness, graph-rewriting, C++, rewriting},
researchr = {https://researchr.org/publication/LaforestLSS97},
cites = {0},
citedby = {0},
pages = {191-199},
booktitle = {HICSS (3)},
}