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]

Abstract

Abstract is missing.