Give you a statement and table with its title in Markdown format, please determine whether the statement is supported or refuted by, or is unrelated to the table. It'a binary classification problem, you should choose the answer between supported and refuted. Table cells in one row are seperated by '|', and different rows are seperated by '
'.

Table:
| counting method | basis | name | directed / undirected | induced / non - induced |
| exact | network - centric | mfinder | both | induced |
| exact | network - centric | esu (fanmod) | both | induced |
| exact | network - centric | kavosh (used in cytokavosh) | both | induced |
| exact | network - centric | g - tries | both | induced |
| exact | subgraph - centric | fpf (mavisto) | both | induced |
| exact | subgraph - centric | nemofinder | undirected | induced |
| exact | subgraph - centric | grochow - kellis | both | both |
| exact | subgraph - centric | moda | both | both |
| estimation / sampling | color - coding approach | n alon et al™s algorithm | undirected | non - induced |
| estimation / sampling | other approaches | mfinder | both | induced |
| estimation / sampling | other approaches | esu (fanmod) | both | induced |
Title:
none
Statement:
exact is the counting method for a network - centric basis
Answer:
supported