Here is the description of all features available in the system for the Graph Coloring Problem.

The total number of features so far is: 36
  1. Number of Nodes
  2. Number of Edges
  3. Degree
  4. Degree Centrality
  5. Betweenness Centrality
  6. Closeness Centrality
  7. Eigenvector Centrality
  8. PageRank Centrality
  9. Density
  10. Eccentricity
  11. Clustering Coefficient
  12. Path Length
  13. Algebraic Connectivity
  14. Energy
  15. Laplacian Index

The following aggregation functions are applied to features in bold:
  1. Minimum
  2. Maximum
  3. Mean
  4. Standard Deviation

Last edited Jul 27, 2014 at 10:25 PM by lucasdeandrade87, version 4