Constructing the Highest Degree Subgraph for Dense Graphs is in NCAS

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]

Authors

Alexander E. Andreev

This author has not been identified. Look up 'Alexander E. Andreev' in Google

Andrea E. F. Clementi

This author has not been identified. Look up 'Andrea E. F. Clementi' in Google

José D. P. Rolim

This author has not been identified. Look up 'José D. P. Rolim' in Google