AbstractThe class of trapezoid graphs is a subclass of cocomparability graphs and contains both the interval graphs and the permutation graphs. In this paper we present an O(n) time algorithm for the minimum cardinality connected dominating set problem and an O(n+m) time algorithm for the minimum cardinality dominating clique problem in trapezoid graphs. Both algorithms require the trapezoid diagram to be given as input
Abstract. The computation of maximum matching is an important task in graph theory. For general grap...
A connected dominating set of a graph G = (V,E) is a subset of vertices CD ⊆ V such that every verte...
In 2008, a unified approach (labeled domination) to several domination problems (k-tuple domination,...
AbstractThe class of trapezoid graphs is a subclass of cocomparability graphs and contains both the ...
AbstractWe investigate the complexity of several domination problems on the complements of bounded t...
AbstractTrapezoid graphs are a class of cocomparability graphs containing interval graphs and permut...
AbstractTrapezoid graphs are a superclass of permutation graphs and interval graphs. This paper pres...
AbstractCircle graphs are the intersection graphs of chords of a circle. In this paper we show that ...
A dominating set of a graph G = (N,E) is a subset S of nodes such that every node is either in S or ...
Abstract: A connected domination set of a graph is a set of vertices such that every vertex not in ...
AbstractA dominating set of a graph G = (N,E) is a subset S of nodes such that every node is either ...
AbstractWe study the paired-domination problem on interval graphs and circular-arc graphs. Given an ...
AbstractA subset of vertices D⊆V of a graph G=(V,E) is a dominating clique if D is a dominating set ...
A connected dominating set of a graph G = (V; E) is a subset of vertices CD V such that every verte...
We show that the minimum fill-in and the minimum interval graph completion of a d-trapezoid graph ca...
Abstract. The computation of maximum matching is an important task in graph theory. For general grap...
A connected dominating set of a graph G = (V,E) is a subset of vertices CD ⊆ V such that every verte...
In 2008, a unified approach (labeled domination) to several domination problems (k-tuple domination,...
AbstractThe class of trapezoid graphs is a subclass of cocomparability graphs and contains both the ...
AbstractWe investigate the complexity of several domination problems on the complements of bounded t...
AbstractTrapezoid graphs are a class of cocomparability graphs containing interval graphs and permut...
AbstractTrapezoid graphs are a superclass of permutation graphs and interval graphs. This paper pres...
AbstractCircle graphs are the intersection graphs of chords of a circle. In this paper we show that ...
A dominating set of a graph G = (N,E) is a subset S of nodes such that every node is either in S or ...
Abstract: A connected domination set of a graph is a set of vertices such that every vertex not in ...
AbstractA dominating set of a graph G = (N,E) is a subset S of nodes such that every node is either ...
AbstractWe study the paired-domination problem on interval graphs and circular-arc graphs. Given an ...
AbstractA subset of vertices D⊆V of a graph G=(V,E) is a dominating clique if D is a dominating set ...
A connected dominating set of a graph G = (V; E) is a subset of vertices CD V such that every verte...
We show that the minimum fill-in and the minimum interval graph completion of a d-trapezoid graph ca...
Abstract. The computation of maximum matching is an important task in graph theory. For general grap...
A connected dominating set of a graph G = (V,E) is a subset of vertices CD ⊆ V such that every verte...
In 2008, a unified approach (labeled domination) to several domination problems (k-tuple domination,...
DOI
Add to ORKG