13 citations · 15 across the 12 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
math.CO2018
Linear programming based approximation for unweighted induced matchings --- breaking the barrier
Julien Baste, Maximilian Fürst, Dieter Rautenbach
A matching in a graph is induced if no two of its edges are joined by an edge, and finding a large induced matching is a very hard problem. Lin et al. (Approximating weighted induc…
cs.DS2018
Temporal Matching
Julien Baste, Binh-Minh Bui-Xuan, Antoine Roux
A link stream is a sequence of pairs of the form , where represents a time instant and . Given an integer , the -edge between vertices $…
cs.CC2018
Minimum Reload Cost Graph Factors
Julien Baste, Didem Gözüpek, Mordechai Shalom +1
The concept of Reload cost in a graph refers to the cost that occurs while traversing a vertex via two of its incident edges. This cost is uniquely determined by the colors of the…