Grounded L-Graphs Are Polynomially χ-Bounded.
James DaviesTomasz KrawczykRose McCartyBartosz WalczakPublished in: Discret. Comput. Geom. (2023)
Keyphrases
- pattern recognition
- polynomially bounded
- graph matching
- neural network
- directed graph
- series parallel
- graph representation
- graph theoretic
- social networks
- similarity measure
- real world
- graph theory
- graph theoretical
- database
- labeled graphs
- small world
- undirected graph
- weighted graph
- graph structure
- random walk
- np complete