A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
We also propose a 1+(2Δ+2)-approximation algorithm for the Minimum Semipaired Domination problem, where Δ denote the maximum degree of the graph and show that the Minimum Semipaired Domination problem ... We show that the decision version of the Minimum Semipaired Domination problem is NP-complete for bipartite graphs and split graphs. ... Complexity difference between paired domination and semipaired domination In this section, we make an observation on complexity difference between paired domination and semipaired domination. ...arXiv:1904.00964v1 fatcat:ptx4pwy3lrbffgk4c32d7wcc6e
In addition, we prove that the Minimum Semipaired Domination problem is APX-complete for graphs with maximum degree 3. ... In this paper, we show that the decision version of the Minimum Semipaired Domination problem remains NP-complete for split graphs, a subclass of chordal graphs. ... Complexity difference between paired domination and semipaired domination In this subsection, we discuss the complexity difference between paired domination and semipaired domination. ...arXiv:2008.13491v3 fatcat:37fsc27z7zgrdli6b6kwclhogm
Out of these 36, 11 were invited to this special issue, and 8 of them have been accepted for publication. ... This special issue contains eight articles which are based on extended abstracts presented at the 30th International Workshop on Combinatorial Algorithms (IWOCA), which was held at the University of Pisa ... Henning, and Vikash Tripathi, in their paper "Complexity and Algorithms for Semipaired Domination in Graphs" address the Minimum Semipaired Domination problem, proving NP-completeness for its decision ...doi:10.1007/s00224-020-10015-8 fatcat:chhwynnikrfhvauzaiqtiisvye
Extensive experiments on three widely used datasets validate its superior performance over several state-of-the-art methods in terms of both accuracy and scalability for online retrieval task. ... In addition, an alternate optimization algorithm is proposed to efficiently make the solution of the model. ... ), and the Taishan Scholar Project of Shandong Province, China. ...doi:10.1093/jcde/qwab052 fatcat:nrlk5k3m5ba6jgjlng6ojqj4hq
and partially paired data in linear time. ... A comprehensive set of experiments clearly show the superior effectiveness and efficiency of CCQ against the state of the art hashing methods for both unimodal and cross-modal retrieval. ... The authors would like to thank Dr Jingdong Wang for insightful comments. This work was supported by National Natural Science ...doi:10.1145/2911451.2911493 dblp:conf/sigir/LongCWY16 fatcat:y7omekozmjghzjztzn3wtij3cq