Login / Signup

The Complexity of Approximately Counting Retractions to Square-free Graphs.

Jacob FockeLeslie Ann GoldbergStanislav Zivný
Published in: ACM Trans. Algorithms (2021)
Keyphrases
  • computational cost
  • directed graph
  • structured objects
  • neural network
  • graph matching
  • feature selection
  • worst case
  • space complexity
  • graph databases
  • complexity analysis
  • graph kernels
  • polynomial time complexity