Overview
Search
Up
Download details

Experimental Study of Approximation Algorithms for the Densest k-Subgraph Pro Experimental Study of Approximation Algorithms for the Densest k-Subgraph Problem

Download

M.Sc. Thesis, by Weizhong Yu (December 2003)

Information
Created 2020-12-13
Changed
Version
Size 628.13 KB
Created by Super User
Changed by
Downloads 35
License
Price
Back
Powered by jDownloads
  • You are here:  
  • Home
  • Publications
  • Theses
  • Experimental Study of Approximation Algorithms for the Densest k-Subgraph Problem