Login / Signup

Simple and Efficient Greedy Algorithms for Hamilton Cycles in Random Intersection Graphs.

Christoforos L. RaptopoulosPaul G. Spirakis
Published in: ISAAC (2005)
Keyphrases
  • greedy algorithms
  • greedy algorithm
  • cost function
  • real time
  • data sets
  • search engine
  • bayesian networks
  • computationally efficient
  • knapsack problem
  • bipartite graph