Login / Signup

Graph characterization of fully indecomposable nonconvertible (0, 1)-matrices with minimal number of ones.

Mikhail BudrevichGregor DolinarAlexander E. GutermanBojan Kuzma
Published in: Ars Math. Contemp. (2019)
Keyphrases
  • small number
  • graph theory
  • neural network
  • case study
  • graphical models
  • random walk
  • directed acyclic graph
  • finite number
  • undirected graph
  • fixed number
  • graph theoretic