NDLTD Global ETD Search
  • Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • Tagged with
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.

Search results

Showing 1 to 1 of 1 (0.107 seconds)
1

Inapproximability of the Edge-Contraction Problem

HIRATA, Tomio, OTSUKI, Hideaki 01 May 2006 (has links)
No description available.
connected vertex cover problem
approximability
approximation algorithm
NP-hard
edge-contraction problem

Page generated in 0.1105 seconds