Login / Signup

Noncrossing Hamiltonian paths in geometric graphs.

Jakub CernýZdenek DvorákVít JelínekJan Kára
Published in: Discret. Appl. Math. (2007)
Keyphrases
  • queueing systems
  • transition probabilities
  • graph theoretical
  • markov chain
  • shortest path
  • arrival rate
  • directed graph
  • graph theory
  • topological information
  • graph mining
  • undirected graph
  • markov models