AbstractThis paper deals with the problem of adding edges to a graph such that the resulting graph becomes an interval graph. The set of edges added is called an augmentation. An algorithm is presented to find a minimal augmentation which runs in a time proportional to the product of the number of vertices and the number of edges of the resulting graph
AbstractGiven an arbitrary graph G=(V,E) and an interval graph H=(V,F) with E⊆F we say that H is an ...
We study the minimum interval deletion problem, which asks for the removal of a set of at most k ver...
AbstractFor a given graph G=(V,E), the interval completion problem of G is to find an edge set F suc...
AbstractThis paper deals with the problem of adding edges to a graph such that the resulting graph b...
AbstractGiven an arbitrary graph G=(V,E) and an interval graph H=(V,F) with E⊆F we say that H is an ...
Abstract We present an algorithm with runtime O(k 2k n 3 m) for the following NP-complete problem [9...
Given an arbitrary graph G = (V,E) and a proper interval graph H = (V,F) with E ⊆ F we say that H i...
Abstract. In this paper we study the problem of recognizing and representing dynamically changing pr...
Abstract. In this paper we study the problem of recognizing and representing dynamically changing pr...
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 ...
Abstract In this paper we study the problem of recognizing and representing dynamically changing pro...
AbstractThe graph reconstruction conjecture is a long-standing open problem in graph theory. There a...
We study the minimum interval deletion problem, which asks for the removal of a set of at most k ver...
AbstractGiven an arbitrary graph G=(V,E) and an interval graph H=(V,F) with E⊆F we say that H is an ...
We study the minimum interval deletion problem, which asks for the removal of a set of at most k ver...
AbstractFor a given graph G=(V,E), the interval completion problem of G is to find an edge set F suc...
AbstractThis paper deals with the problem of adding edges to a graph such that the resulting graph b...
AbstractGiven an arbitrary graph G=(V,E) and an interval graph H=(V,F) with E⊆F we say that H is an ...
Abstract We present an algorithm with runtime O(k 2k n 3 m) for the following NP-complete problem [9...
Given an arbitrary graph G = (V,E) and a proper interval graph H = (V,F) with E ⊆ F we say that H i...
Abstract. In this paper we study the problem of recognizing and representing dynamically changing pr...
Abstract. In this paper we study the problem of recognizing and representing dynamically changing pr...
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 ...
Abstract In this paper we study the problem of recognizing and representing dynamically changing pro...
AbstractThe graph reconstruction conjecture is a long-standing open problem in graph theory. There a...
We study the minimum interval deletion problem, which asks for the removal of a set of at most k ver...
AbstractGiven an arbitrary graph G=(V,E) and an interval graph H=(V,F) with E⊆F we say that H is an ...
We study the minimum interval deletion problem, which asks for the removal of a set of at most k ver...
AbstractFor a given graph G=(V,E), the interval completion problem of G is to find an edge set F suc...
DOI
Add to ORKG