Login / Signup

Combinatorial algorithms with performance guarantees for finding several Hamiltonian circuits in a complete directed weighted graph.

Eduard Kh. GimadiAlexei N. GlebovA. A. SkretnevaO. Yu. TsidulkoD. Zh. Zambalaeva
Published in: Discret. Appl. Math. (2015)
Keyphrases
  • weighted graph
  • data structure
  • computational complexity
  • minimum spanning tree
  • feature selection
  • worst case
  • multi dimensional
  • data objects
  • graph theory
  • graph clustering