Login / Signup
On (n,m)-chromatic numbers of graphs with bounded sparsity parameters.
Sandip Das
Abhiruk Lahiri
Soumen Nandi
Sagnik Sen
S. Taruni
Published in:
Discret. Appl. Math. (2024)
Keyphrases
</>
input parameters
maximum likelihood
graph matching
image processing
parameter estimation
parameter values
high dimensional
graph theory
parameter settings
parameter space
sensitivity analysis
sparse representation
color images
probability density function
graph structure
graph databases
spanning tree