A graph on n vertices is a k-gap interval graph if it has a multiple interval representation with at most n+k intervals in total.
Dec 14, 2011
A graph on n vertices is a k-gap interval graph if it has a multiple interval representation with at most n + k intervals in total. In ...
A graph on n vertices is a k-gap interval graph if it has a multiple interval representation with at most n + k intervals in total. In order to scale up the ...
With the objective to generalize interval graphs while maintaining their nice algorithmic properties, we define k-gap interval graphs as multiple interval ...
In order to scale up the nice algorithmic properties of interval graphs (where k = 0), the study of a new parameterization of graph problems by k is ...
A graph on n vertices is a k-gap interval graph if it has a multiple interval representation with at most n + k intervals in total. In order to scale up the ...
Jan 25, 2021 · In a multiple interval representation of a graph, each vertex is associated to at least one interval of the real line, with an edge between two ...
A graph on n vertices is a k-gap interval graph if it has a multiple interval representation with at most n+k intervals in total. In order to scale up the nice ...
Bibliographic details on k-Gap Interval Graphs.
Bibliographic details on k-Gap Interval Graphs.