Login / Signup

A binary-matroid analogue of a graph connectivity theorem of Jamison and Mulder.

Cameron CrenshawJames G. Oxley
Published in: Adv. Appl. Math. (2023)
Keyphrases
  • graph connectivity
  • greedy algorithm
  • weighted graph
  • data objects
  • text mining
  • von neumann