We provide polynomial time data reduction rules for Connected Dominating Set in planar graphs and analyze these to obtain a linear kernel for the planar Connected Dominating Set pr...
In this study we address the problem of extracting a robust connectivity metric for brain white matter. We defined the connectivity problem as an energy minimization task, by assoc...
Metric and kernel learning arise in several machine learning applications. However, most existing metric learning algorithms are limited to learning metrics over low-dimensional d...
Prateek Jain, Brian Kulis, Jason V. Davis, Inderji...
Crown structures in a graph are defined and shown to be useful in kernelization algorithms for the classic vertex cover problem. Two vertex cover kernelization methods are discus...
Faisal N. Abu-Khzam, Michael R. Fellows, Michael A...
The biological interpretation of large-scale gene expression data is one of the challenges in current bioinformatics. The state-of-theart approach is to perform clustering and then...
Italo Zoppis, Daniele Merico, Marco Antoniotti, Bu...