In this report, we list the algorithms proposed in the literature of Frequent Subgraph Mining (FSM) in Centralized Graph Transaction Databases. We categorize FSM algorithms in four categories of their search and matching strategy which is affecting their returned output (ie, frequent subgraphs). For each category, we list the algorithms. We filter algorithms usable in specific cases of graphs (ie, not applicable to general graphs cases). We enumerate the available software of the algorithms. This report could be helpful for having a list of FSM algorithms in Centralized Graph Transaction Databases.