On the complexity of embedding in graph products.
Therese BiedlDavid EppsteinTorsten UeckerdtPublished in: CoRR (2023)
Keyphrases
- graph representation
- graph embedding
- graph model
- graph theoretic
- computational complexity
- computational cost
- worst case
- vector space
- graph matching
- decision problems
- product design
- graph theory
- graph clustering
- connected components
- spectral embedding
- polynomial time complexity
- data sets
- space complexity
- graph mining
- directed graph
- digital images
- social networks
- neural network