On the exact maximum induced density of almost all graphs and their inducibility.
Raphael YusterPublished in: J. Comb. Theory, Ser. B (2019)
Keyphrases
- graph matching
- graph theoretic
- density function
- databases
- subgraph isomorphism
- structured objects
- pattern recognition
- bipartite graph
- weighted graph
- graph clustering
- graph kernels
- graph partitioning
- maximum error
- labeled graphs
- low density
- series parallel
- random graphs
- maximum number
- graph mining
- image segmentation
- information systems
- data mining