Sign in

Finding Hamiltonian circuits in quasi-adjoint graphs.

Jacek BlazewiczMarta KasprzakBenjamin Leroy-BeaulieuDominique de Werra
Published in: Discret. Appl. Math. (2008)
Keyphrases
  • high speed
  • graph matching
  • optimal control
  • maximum clique
  • database
  • low cost
  • weighted graph
  • graph construction
  • digital circuits
  • analog vlsi