Grounded L-graphs are polynomially χ-bounded.
James DaviesTomasz KrawczykRose McCartyBartosz WalczakPublished in: CoRR (2021)
Keyphrases
- polynomially bounded
- structured objects
- graph databases
- graph theoretic
- graph construction
- directed graph
- graph matching
- graph theory
- series parallel
- graph mining
- graph theoretical
- information systems
- subgraph isomorphism
- graph partitioning
- graph kernels
- graph representation
- graph model
- graph structure
- bayesian networks
- feature selection