AbstractWe show that the problems steiner tree, dominating set and connected dominating set are NP-complete for chordal bipartite graphs
AbstractWe present an efficient parallel algorithm for the computation of a minimum Steiner tree for...
AbstractThe Steiner tree problem on weighted graphs seeks a minimum weight subtree containing a give...
The Steiner tree problem on weighted graphs seeks a minimum weight subtree containing a given subset...
AbstractEfficient algorithms are developed for finding a minimum cardinality connected dominating se...
AbstractExtending previous NP-completeness results for the harmonious coloring problem and the pair-...
In this work we obtain a new graph class where the {. k}-dominating function problem ({. k}-DOM) is ...
The issue of determining the complexity of modification problems for chordal bipartite graphs has be...
AbstractGolumbic, Kaplan, and Shamir [Graph sandwich problems, J. Algorithms 19 (1995) 449–473], in ...
AbstractEfficient algorithms are developed for finding a minimum cardinality connected dominating se...
A K-Cluster in a graph is an induced sub graph on k-vertices, which maximizes the number of edges. B...
AbstractA k-cluster in a graph is an induced subgraph on k vertices which maximizes the number of ed...
An independent dominatingset of a graph G = (V; E) is a pairwise non-adjacent subset D of V such tha...
AbstractIn this paper several results are proved: (1) Deciding whether a given planar graph G with m...
Steiner tree problem in weighted graphs seeks a minimum weight subtree containing a given subset of ...
AbstractWe prove that the maximum edge biclique problem in bipartite graphs is NP-complete
AbstractWe present an efficient parallel algorithm for the computation of a minimum Steiner tree for...
AbstractThe Steiner tree problem on weighted graphs seeks a minimum weight subtree containing a give...
The Steiner tree problem on weighted graphs seeks a minimum weight subtree containing a given subset...
AbstractEfficient algorithms are developed for finding a minimum cardinality connected dominating se...
AbstractExtending previous NP-completeness results for the harmonious coloring problem and the pair-...
In this work we obtain a new graph class where the {. k}-dominating function problem ({. k}-DOM) is ...
The issue of determining the complexity of modification problems for chordal bipartite graphs has be...
AbstractGolumbic, Kaplan, and Shamir [Graph sandwich problems, J. Algorithms 19 (1995) 449–473], in ...
AbstractEfficient algorithms are developed for finding a minimum cardinality connected dominating se...
A K-Cluster in a graph is an induced sub graph on k-vertices, which maximizes the number of edges. B...
AbstractA k-cluster in a graph is an induced subgraph on k vertices which maximizes the number of ed...
An independent dominatingset of a graph G = (V; E) is a pairwise non-adjacent subset D of V such tha...
AbstractIn this paper several results are proved: (1) Deciding whether a given planar graph G with m...
Steiner tree problem in weighted graphs seeks a minimum weight subtree containing a given subset of ...
AbstractWe prove that the maximum edge biclique problem in bipartite graphs is NP-complete
AbstractWe present an efficient parallel algorithm for the computation of a minimum Steiner tree for...
AbstractThe Steiner tree problem on weighted graphs seeks a minimum weight subtree containing a give...
The Steiner tree problem on weighted graphs seeks a minimum weight subtree containing a given subset...
DOI
Add to ORKG