SOUR graphs for efficient completion.
Lynch, Christopher ; Strogova Polina
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only], Tome 2 (1998), p. 1-25 / Harvested from The Electronic Library of Mathematics
Full (PDF)
Access to full text
Publié le : 1998-01-01
EUDML-ID : urn:eudml:doc:120591 
@article{01375600,
     title = {SOUR graphs for efficient completion.},
     journal = {Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]},
     volume = {2},
     year = {1998},
     pages = {1-25},
     zbl = {0947.68083},
     language = {en},
     url = {http://dml.mathdoc.fr/item/01375600}
}

Lynch, Christopher; Strogova Polina. SOUR graphs for efficient completion.. Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only], Tome 2 (1998) pp. 1-25. http://gdmltest.u-ga.fr/item/01375600/