Login / Signup

Description of the Tournaments Which are Reconstructible from Their k-cycle Partial Digraphs for k ∈ {3, 4}.

Rim Ben HamadouYoussef BoudabbousNadia El AmriGérard Lopez
Published in: Graphs Comb. (2016)
Keyphrases
  • high level
  • equivalence classes
  • real time
  • learning algorithm
  • data structure
  • markov models
  • graphical representation
  • database
  • databases
  • real world
  • data mining
  • case study
  • multi agent systems