Login / Signup

On the characterization of 1-sided error strongly testable graph properties for bounded-degree graphs.

Hiro ItoAreej KhouryIlan Newman
Published in: Comput. Complex. (2020)
Keyphrases
  • graph properties
  • graph theoretic
  • bounded degree
  • graph theory
  • directed graph
  • maximal cliques
  • computational complexity
  • databases
  • database
  • data mining
  • social networks
  • index structure
  • graph data