activity
20132023
most citedIs Learning to Rank Worth It? A Statistical Analysis of Learning to Rank Methods

4 citations · 7 across the 8 of their papers we have counts for

collaborators
Showing cs.DMShow all

2 papers · 1 filter

cs.DM2022★ 1 cited

Weighted Connected Matchings

Guilherme C. M. Gomes, Bruno P. Masquio, Paulo E. D. Pinto +2

A matching is a -matching if the subgraph induced by the endpoints of the edges of satisfies property . As examples, for appropriate choices of $\…

cs.DM2021

Disconnected Matchings

Guilherme C. M. Gomes, Bruno P. Masquio, Paulo E. D. Pinto +2

In 2005, Goddard, Hedetniemi, Hedetniemi and Laskar [Generalized subgraph-restricted matchings in graphs, Discrete Mathematics, 293 (2005) 129 - 138] asked the computational comple…