Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim. Constructing the Highest Degree Subgraph for Dense Graphs is in NCAS. Theoretical Computer Science, 161(1&2):307-314, 1996. [doi]
@article{AndreevCR96,
title = {Constructing the Highest Degree Subgraph for Dense Graphs is in NCAS},
author = {Alexander E. Andreev and Andrea E. F. Clementi and José D. P. Rolim},
year = {1996},
doi = {10.1016/0304-3975(96)00014-X},
url = {http://dx.doi.org/10.1016/0304-3975(96)00014-X},
tags = {graph-rewriting, e-science, rewriting},
researchr = {https://researchr.org/publication/AndreevCR96},
cites = {0},
citedby = {0},
journal = {Theoretical Computer Science},
volume = {161},
number = {1&2},
pages = {307-314},
}