Login / Signup
Netlike partial cubes, IV: Fixed finite subgraph theorems.
Norbert Polat
Published in:
Eur. J. Comb. (2009)
Keyphrases
</>
np hard
graph mining
case study
graph databases
unit length
databases
learning algorithm
search space
space time
fixed number
partial information
connected subgraphs