On tradeoffs between width- and fill-like graph parameters.

Dariusz Dereniowski Adam Stanski

Published in: CoRR (2018)

Keyphrases

input data
maximum likelihood
random walk
parameter estimation
sensitivity analysis
directed graph
weighted graph
directed acyclic graph
graph representation
multiscale
k means
expectation maximization
parameter values
graph structure
measured data