SOUR graphs for efficient completion.

Lynch, Christopher, and Strogova Polina. "SOUR graphs for efficient completion.." Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only] 2.1 (1998): 1-25. <http://eudml.org/doc/120591>.

@article{Lynch1998,
author = {Lynch, Christopher, Strogova Polina},
journal = {Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]},
keywords = {completion algorithms; SOUR graphs},
language = {eng},
number = {1},
pages = {1-25},
publisher = {Maison de l'Informatique et des Mathématiques Discrètes, MIMD},
title = {SOUR graphs for efficient completion.},
url = {http://eudml.org/doc/120591},
volume = {2},
year = {1998},
}

TY - JOUR
AU - Lynch, Christopher
AU - Strogova Polina
TI - SOUR graphs for efficient completion.
JO - Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
PY - 1998
PB - Maison de l'Informatique et des Mathématiques Discrètes, MIMD
VL - 2
IS - 1
SP - 1
EP - 25
LA - eng
KW - completion algorithms; SOUR graphs
UR - http://eudml.org/doc/120591
ER -