Kernelization using structural parameters on sparse graph classes.
Jakub GajarskýPetr HlinenýJan ObdrzálekSebastian OrdyniakFelix ReidlPeter RossmanithFernando Sánchez VillaamilSomnath SikdarPublished in: J. Comput. Syst. Sci. (2017)
Keyphrases
- sensitivity analysis
- parameter values
- multivariate gaussian distribution
- connected components
- structural information
- graph matching
- graph theory
- equivalence classes
- data sets
- random walk
- neural network
- parameter space
- directed graph
- parameter settings
- graph structure
- weighted graph
- graph model
- graph databases
- graph representation
- graph theoretic
- sparse data
- maximum likelihood
- initial estimates
- spatially localized
- bounded degree