Login / Signup

The maximal subgroups and the complexity of the flow semigroup of finite (di)graphs.

Gábor HorváthChrystopher L. NehanivKároly Podoski
Published in: Int. J. Algebra Comput. (2017)
Keyphrases
  • independent set
  • graph matching
  • graph mining
  • subgroup discovery
  • database
  • case study
  • pattern mining
  • flow field
  • graph theory
  • weighted graph
  • graph model
  • series parallel