Login / Signup

A Fortran IV Program for Finding the Smallest Set of Smallest Rings of a Graph.

Burghardt SchmidtJörg Fleischhauer
Published in: J. Chem. Inf. Comput. Sci. (1978)
Keyphrases
  • small number
  • random walk
  • directed graph
  • search engine
  • method finds