A block coordinate descent algorithm computes generalized median graphs by iteratively alternating optimizations over node and edge edit operations.
Soft Computing 10(1), 47–53 (2006)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CV 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Generalized Median Graph via Iterative Alternate Minimizations
A block coordinate descent algorithm computes generalized median graphs by iteratively alternating optimizations over node and edge edit operations.