Login / Signup

Counting the minimum number of arcs in an oriented graph having weak diameter 2.

Sandip DasKoushik Kumar DeyPavan P. DSagnik Sen
Published in: CoRR (2023)
Keyphrases
  • small number
  • data mining
  • information retrieval
  • learning algorithm
  • website
  • structured data
  • database
  • neural network
  • decision trees
  • case study
  • objective function
  • computational complexity
  • pairwise
  • undirected graph