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 ...
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.
People also ask
What is an equal interval graph in ABa?
What is interval K?
How do you tell if a graph is an interval graph?
How do you recognize an interval graph?
There is an infinite family (Gk)k≥1 of mixed interval graphs with |V (Gk)| = 2k2, λ(Gk) = k − 1, ω(Gk)=2k, and χ(Gk)=(k + 1) · k = (λ(Gk) + 2) · ω(Gk)/2. Proof.
In the following two theorems, we show that with two parameters k and l, k-SEPARATING VERTICES remains W[1]-hard in multiple-interval graphs and their ...
Multiple interval graphs are a well-known generalization of interval graphs introduced in the 1970s to deal with situations arising naturally in scheduling ...