6 citations · 24 across the 32 of their papers we have counts for
1 paper · 2 filters
Stéphane Bessy, Anthony Perez
Given a graph G = (V,E) and a positive integer k, the Proper Interval Completion problem asks whether there exists a set F of at most k pairs of (V \times V)\E such that the graph…