Login / Signup

An analogue of Edmonds' Branching Theorem for infinite digraphs.

J. Pascal GollinKarl Heuer
Published in: Eur. J. Comb. (2021)
Keyphrases
  • branch and bound
  • equivalence classes
  • directed graph
  • von neumann
  • search tree
  • infinite dimensional
  • databases
  • neural network
  • knowledge base
  • decision trees
  • random walk
  • digital topology