AbstractGiven an arbitrary graph G=(V,E) and an interval graph H=(V,F) with E⊆F we say that H is an interval completion of G. The graph H is called a minimal interval completion of G if, for any sandwich graph H′=(V,F′) with E⊆F′⊂F, H′ is not an interval graph. In this paper we give a O(nm) time algorithm computing a minimal interval completion of an arbitrary graph. The output is an interval model of the completion
An interval graph is the intersection graph of a collection of intervals. Interval graphs are a spec...
Abstract. In this paper we study the problem of recognizing and representing dynamically changing pr...
AbstractAn assignment of unique integers to the vertices of a graph is called a linear layout. The b...
Given an arbitrary graph G = (V,E) and a proper interval graph H = (V,F) with E ⊆ F we say that H i...
AbstractGiven an arbitrary graph G=(V,E) and an interval graph H=(V,F) with E⊆F we say that H is an ...
AbstractFor a given graph G=(V,E), the interval completion problem of G is to find an edge set F suc...
Abstract We present an algorithm with runtime O(k 2k n 3 m) for the following NP-complete problem [9...
AbstractThis paper deals with the problem of adding edges to a graph such that the resulting graph b...
The minimum interval graph completion problem consists of, given a graph G = ( V, E ), finding a sup...
The minimum interval graph completion problem consists of, given a graph G = ( V, E ), finding a sup...
We give an algorithm with runtime O(k 2k n 3 m) for the NP-complete problem [GT35 in 6] of deciding ...
Pathwidth and treewidth have been introduced by Robertson and Seymour in their work on graph minors....
AbstractA t-interval representation of a graph expresses it as the intersection graph of a family of...
Let G be an input graph with n vertices and m edges and let k be a fixed parameter. We provide a sin...
AbstractThis paper deals with the problem of adding edges to a graph such that the resulting graph b...
An interval graph is the intersection graph of a collection of intervals. Interval graphs are a spec...
Abstract. In this paper we study the problem of recognizing and representing dynamically changing pr...
AbstractAn assignment of unique integers to the vertices of a graph is called a linear layout. The b...
Given an arbitrary graph G = (V,E) and a proper interval graph H = (V,F) with E ⊆ F we say that H i...
AbstractGiven an arbitrary graph G=(V,E) and an interval graph H=(V,F) with E⊆F we say that H is an ...
AbstractFor a given graph G=(V,E), the interval completion problem of G is to find an edge set F suc...
Abstract We present an algorithm with runtime O(k 2k n 3 m) for the following NP-complete problem [9...
AbstractThis paper deals with the problem of adding edges to a graph such that the resulting graph b...
The minimum interval graph completion problem consists of, given a graph G = ( V, E ), finding a sup...
The minimum interval graph completion problem consists of, given a graph G = ( V, E ), finding a sup...
We give an algorithm with runtime O(k 2k n 3 m) for the NP-complete problem [GT35 in 6] of deciding ...
Pathwidth and treewidth have been introduced by Robertson and Seymour in their work on graph minors....
AbstractA t-interval representation of a graph expresses it as the intersection graph of a family of...
Let G be an input graph with n vertices and m edges and let k be a fixed parameter. We provide a sin...
AbstractThis paper deals with the problem of adding edges to a graph such that the resulting graph b...
An interval graph is the intersection graph of a collection of intervals. Interval graphs are a spec...
Abstract. In this paper we study the problem of recognizing and representing dynamically changing pr...
AbstractAn assignment of unique integers to the vertices of a graph is called a linear layout. The b...
DOI
Add to ORKG