Add to ORKGA connected dominating set of a graph G = (V; E) is a subset of vertices CD V such that every vertex not in CD is adjacent to at least one vertex in CD, and the subgraph induced by CD is connected. We show that, given an arc family F with endpoints sorted, a minimum-cardinality connected dominating set of the circular-arc graph constructed from F can be computed in O(jF j) time
AbstractThe class of trapezoid graphs is a subclass of cocomparability graphs and contains both the ...
A new algorithm is presented for finding a maximum independent set of a circular-arc graph. When the...
AbstractA vertex u in an undirected graph G = (V, E) is said to dominate all its adjacent vertices a...
A connected dominating set of a graph G = (V,E) is a subset of vertices CD ⊆ V such that every verte...
Abstract: A connected domination set of a graph is a set of vertices such that every vertex not in ...
A dominating set of a graph G = (N,E) is a subset S of nodes such that every node is either in S or ...
AbstractA dominating set of a graph G = (N,E) is a subset S of nodes such that every node is either ...
Given a graph G = (V,E), a perfect dominating set is a subset of vertices V ⊆ V (G) such that each v...
A set S ⊆ V is a power dominating set (PDS) of a graph G = (V,E) if every vertex and every edge in G...
AbstractCircle graphs are the intersection graphs of chords of a circle. In this paper we show that ...
A connected dominating set D is a set of vertices of a graph G = (V, E) such that every vertex in V ...
Finding a minimum connected dominating set (connected domination) is known-complete for chordal bipa...
AbstractWe study the paired-domination problem on interval graphs and circular-arc graphs. Given an ...
Let G = (V; E) be a connected graph. A connected dominating set S V is a dominating set that induc...
Connected domination, i.e. the problem of finding a minimum connected dominating set in a graph, was...
AbstractThe class of trapezoid graphs is a subclass of cocomparability graphs and contains both the ...
A new algorithm is presented for finding a maximum independent set of a circular-arc graph. When the...
AbstractA vertex u in an undirected graph G = (V, E) is said to dominate all its adjacent vertices a...
A connected dominating set of a graph G = (V,E) is a subset of vertices CD ⊆ V such that every verte...
Abstract: A connected domination set of a graph is a set of vertices such that every vertex not in ...
A dominating set of a graph G = (N,E) is a subset S of nodes such that every node is either in S or ...
AbstractA dominating set of a graph G = (N,E) is a subset S of nodes such that every node is either ...
Given a graph G = (V,E), a perfect dominating set is a subset of vertices V ⊆ V (G) such that each v...
A set S ⊆ V is a power dominating set (PDS) of a graph G = (V,E) if every vertex and every edge in G...
AbstractCircle graphs are the intersection graphs of chords of a circle. In this paper we show that ...
A connected dominating set D is a set of vertices of a graph G = (V, E) such that every vertex in V ...
Finding a minimum connected dominating set (connected domination) is known-complete for chordal bipa...
AbstractWe study the paired-domination problem on interval graphs and circular-arc graphs. Given an ...
Let G = (V; E) be a connected graph. A connected dominating set S V is a dominating set that induc...
Connected domination, i.e. the problem of finding a minimum connected dominating set in a graph, was...
AbstractThe class of trapezoid graphs is a subclass of cocomparability graphs and contains both the ...
A new algorithm is presented for finding a maximum independent set of a circular-arc graph. When the...
AbstractA vertex u in an undirected graph G = (V, E) is said to dominate all its adjacent vertices a...