Log in

Relevant bibliographies by topics / Dominating set

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers
Reports

Academic literature on the topic 'Dominating set'

Author: Grafiati

Published: 4 June 2021

Last updated: 11 June 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Dominating set.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Dominating set"

1

Enriquez, Enrico L., and Albert D. Ngujo. "Clique doubly connected domination in the join and lexicographic product of graphs." Discrete Mathematics, Algorithms and Applications 12, no. 05 (2020): 2050066. http://dx.doi.org/10.1142/s1793830920500664.

Full text

Abstract:

Let [Formula: see text] be a connected simple graph. A set [Formula: see text] is a doubly connected dominating set if it is dominating and both [Formula: see text] and [Formula: see text] are connected. A nonempty subset [Formula: see text] of the vertex set [Formula: see text] is a clique in [Formula: see text] if the graph [Formula: see text] induced by [Formula: see text] is complete. A clique dominating set [Formula: see text] of [Formula: see text] is a clique doubly connected dominating set if [Formula: see text] is a doubly connected dominating set of [Formula: see text]. The clique doubly connected domination number of [Formula: see text], denoted by [Formula: see text], is the smallest cardinality of a clique doubly connected dominating set [Formula: see text] of [Formula: see text]. In this paper, we give the characterization of the clique doubly connected dominating set and the clique doubly connected domination number in the join (and lexicographic product) of two graphs.

APA, Harvard, Vancouver, ISO, and other styles

2

Berberler, Murat Erşen, Onur Uğurlu, and Zeynep Nihan Berberler. "Independent strong weak domination: A mathematical programming approach." Discrete Mathematics, Algorithms and Applications 12, no. 05 (2020): 2050062. http://dx.doi.org/10.1142/s1793830920500627.

Full text

Abstract:

Let [Formula: see text] be a graph. A subset [Formula: see text] of vertices is a dominating set if every vertex in [Formula: see text] is adjacent to at least one vertex of [Formula: see text]. The domination number is the minimum cardinality of a dominating set. Let [Formula: see text]. Then, [Formula: see text] strongly dominates [Formula: see text] and [Formula: see text] weakly dominates [Formula: see text] if (i) [Formula: see text] and (ii) [Formula: see text]. A subset [Formula: see text] of [Formula: see text] is a strong (weak) dominating set of [Formula: see text] if every vertex in [Formula: see text] is strongly (weakly) dominated by at least one vertex in [Formula: see text]. The strong (weak) domination number of [Formula: see text] is the minimum cardinality of a strong (weak) dominating set. A set [Formula: see text] is an independent (or stable) set if no two vertices of [Formula: see text] are adjacent. The independent domination number of [Formula: see text] (independent strong domination number, independent weak domination number, respectively) is the minimum size of an independent dominating set (independent strong dominating set, independent weak dominating set, respectively) of [Formula: see text]. In this paper, mathematical models are developed for the problems of independent domination and independent strong (weak) domination of a graph. Then test problems are solved by the GAMS software, the optima and execution times are implemented. To the best of our knowledge, this is the first mathematical programming formulations for the problems, and computational results show that the proposed models are capable of finding optimal solutions within a reasonable amount of time.

APA, Harvard, Vancouver, ISO, and other styles

3

John, J., and N. Arianayagam. "The detour domination number of a graph." Discrete Mathematics, Algorithms and Applications 09, no. 01 (2017): 1750006. http://dx.doi.org/10.1142/s1793830917500069.

Full text

Abstract:

For a connected graph [Formula: see text], a set [Formula: see text] is called a detour dominating set of [Formula: see text], if [Formula: see text] is a detour set and dominating set of [Formula: see text]. The detour domination number [Formula: see text] of [Formula: see text] is the minimum order of its detour dominating sets and any detour dominating set of order [Formula: see text] is called a [Formula: see text] - set of [Formula: see text]. The detour domination numbers of some standard graphs are determined. Connected graph of order [Formula: see text] with detour domination number [Formula: see text] or [Formula: see text] is characterized. For positive integers [Formula: see text] and [Formula: see text] with [Formula: see text], there exists a connected graph with [Formula: see text] and [Formula: see text].

APA, Harvard, Vancouver, ISO, and other styles

4

Bakhshesh, Davood. "Characterization of some classes of graphs with equal domination number and isolate domination number." Discrete Mathematics, Algorithms and Applications 12, no. 05 (2020): 2050065. http://dx.doi.org/10.1142/s1793830920500652.

Full text

Abstract:

Let [Formula: see text] be a simple and undirected graph with vertex set [Formula: see text]. A set [Formula: see text] is called a dominating set of [Formula: see text], if every vertex in [Formula: see text] is adjacent to at least one vertex in [Formula: see text]. The minimum cardinality of a dominating set of [Formula: see text] is called the domination number of [Formula: see text], denoted by [Formula: see text]. A dominating set [Formula: see text] of [Formula: see text] is called isolate dominating, if the induced subgraph [Formula: see text] of [Formula: see text] contains at least one isolated vertex. The minimum cardinality of an isolate dominating set of [Formula: see text] is called the isolate domination number of [Formula: see text], denoted by [Formula: see text]. In this paper, we show that for every proper interval graph [Formula: see text], [Formula: see text]. Moreover, we provide a constructive characterization for trees with equal domination number and isolate domination number. These solve part of an open problem posed by Hamid and Balamurugan [Isolate domination in graphs, Arab J. Math. Sci. 22(2) (2016) 232–241].

APA, Harvard, Vancouver, ISO, and other styles

5

Vasanthi, R., and K. Subramanian. "On the minimum vertex covering transversal dominating sets in graphs and their classification." Discrete Mathematics, Algorithms and Applications 09, no. 05 (2017): 1750069. http://dx.doi.org/10.1142/s1793830917500690.

Full text

Abstract:

Let [Formula: see text] be a simple and connected graph. A dominating set [Formula: see text] is said to be a vertex covering transversal dominating set if it intersects every minimum vertex covering set of [Formula: see text]. The vertex covering transversal domination number [Formula: see text] is the minimum cardinality among all vertex covering transversal dominating sets of [Formula: see text]. A vertex covering transversal dominating set of minimum cardinality [Formula: see text] is called a minimum vertex covering transversal dominating set or simply a [Formula: see text]-set. In this paper, we prove some general theorems on the vertex covering transversal domination number of a simple connected graph. We also provide some results about [Formula: see text]-sets and try to classify those sets based on their intersection with the minimum vertex covering sets.

APA, Harvard, Vancouver, ISO, and other styles

6

Xaviour, X. Lenin, and S. Robinson Chellathurai. "Geodetic global domination in corona and strong product of graphs." Discrete Mathematics, Algorithms and Applications 12, no. 04 (2020): 2050043. http://dx.doi.org/10.1142/s1793830920500433.

Full text

Abstract:

A set S of vertices in a connected graph [Formula: see text] is called a geodetic set if every vertex not in [Formula: see text] lies on a shortest path between two vertices from [Formula: see text]. A set [Formula: see text] of vertices in [Formula: see text] is called a dominating set of [Formula: see text] if every vertex not in [Formula: see text] has at least one neighbor in [Formula: see text]. A set [Formula: see text] is called a geodetic global dominating set of [Formula: see text] if [Formula: see text] is both geodetic and global dominating set of [Formula: see text]. The geodetic global domination number is the minimum cardinality of a geodetic global dominating set in [Formula: see text]. In this paper, we determine the geodetic global domination number of the corona and strong products of two graphs.

APA, Harvard, Vancouver, ISO, and other styles

7

Samuel, Libin Chacko, and Mayamma Joseph. "New results on connected dominating structures in graphs." Acta Universitatis Sapientiae, Informatica 11, no. 1 (2019): 52–64. http://dx.doi.org/10.2478/ausi-2019-0004.

Full text

Abstract:

Abstract A set of vertices in a graph is a dominating set if every vertex not in the set is adjacent to at least one vertex in the set. A dominating structure is a subgraph induced by the dominating set. Connected domination is a type of domination where the dominating structure is connected. Clique domination is a type of domination in graphs where the dominating structure is a complete subgraph. The clique domination number of a graph G denoted by γk(G) is the minimum cardinality among all the clique dominating sets of G. We present few properties of graphs admitting dominating cliques along with bounds on clique domination number in terms of order and size of the graph. A necessary and sufficient condition for the existence of dominating clique in strong product of graphs is presented. A forbidden subgraph condition necessary to imply the existence of a connected dominating set of size four also is found.

APA, Harvard, Vancouver, ISO, and other styles

8

Al-Harere, Manal N., Ahmed A. Omran, and Athraa T. Breesam. "Captive domination in graphs." Discrete Mathematics, Algorithms and Applications 12, no. 06 (2020): 2050076. http://dx.doi.org/10.1142/s1793830920500767.

Full text

Abstract:

In this paper, a new definition of graph domination called “Captive Domination” is introduced. The proper subset of the vertices of a graph [Formula: see text] is a captive dominating set if it is a total dominating set and each vertex in this set dominates at least one vertex which doesn’t belong to the dominating set. The inverse captive domination is also introduced. The lower and upper bounds for the number of edges of the graph are presented by using the captive domination number. Moreover, the lower and upper bounds for the captive domination number are found by using the number of vertices. The condition when the total domination and captive domination number are equal to two is discussed and obtained results. The captive domination in complement graphs is discussed. Finally, the captive dominating set of paths and cycles are determined.

APA, Harvard, Vancouver, ISO, and other styles

9

Raza, Hassan, Naveed Iqbal, Hamda Khan, and Thongchai Botmart. "Computing locating-total domination number in some rotationally symmetric graphs." Science Progress 104, no. 4 (2021): 003685042110534. http://dx.doi.org/10.1177/00368504211053417.

Full text

Abstract:

Let [Formula: see text] be a connected graph. A locating-total dominating set in a graph G is a total dominating set S of a G, for every pair of vertices [Formula: see text], such that [Formula: see text]. The minimum cardinality of a locating-total dominating set is called locating-total domination number and represented as [Formula: see text]. In this paper, locating-total domination number is determined for some cycle-related graphs. Furthermore, some well-known graphs of convex polytopes from the literature are also considered for the locating-total domination number.

APA, Harvard, Vancouver, ISO, and other styles

10

Eakawinrujee, Pannawat, та Nantapath Trakultraipruk. "Γ -Paired dominating graphs of some paths". MATEC Web of Conferences 189 (2018): 03029. http://dx.doi.org/10.1051/matecconf/201818903029.

Full text

Abstract:

A paired dominating set of a graph G = (V(G),E(G)) is a set D of vertices of G such that every vertex is adjacent to some vertex in D, and the subgraph of G induced by D contains a perfect matching. The upper paired domination number of G, denoted by Γpr(G) is the maximum cardinality of a minimal paired dominating set of G. A paired dominatin set of cardinality Γ pr(G) is called a Γpr(G) -set. The Γ -paired dominating graph of G, denoted by ΓPD(G), is the graph whose vertex set is the set of all Γ pr(G) -sets, and two Γpr(G) -sets are adjacentin ΓPD(G) if one can be obtained from the other by removing one vertex and adding another vertex of G. In this paper, we present the Γ-paired dominating graphs of some paths.

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Dominating set"

1

ALBUQUERQUE, MAYRA CARVALHO. "MATHEURISTICS FOR VARIANTS OF THE DOMINATING SET PROBLEM." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2018. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=34169@1.

Full text

Abstract:

PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO<br>CONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICO<br>Esta tese faz um estudo do problema do Conjunto Dominante, um problema NP-difícil de grande relevância em aplicações relacionadas ao projeto de rede sem fio, mineração de dados, teoria de códigos, dentre outras. O conjunto dominante mínimo em um grafo é um conjunto mínimo de vértices de modo que cada vértice do grafo pertence a este conjunto ou é adjacente a um vértice que pertence a ele. Três variantes do problema foram estudadas; primeiro, uma variante na qual considera pesos nos vértices, buscando um conjunto dominante com menor peso total; segundo, uma variante onde o subgrafo induzido pelo conjunto dominante está conectado; e, finalmente, a variante que engloba essas duas características. Para resolver esses três problemas, propõe-se um algoritmo híbrido baseado na meta-heurística busca tabu com componentes adicionais de programação matemática, resultando em um método por vezes chamado de mateurística, (matheuristic, em inglês). Diversas técnicas adicionais e vizinhanças largas foram propostas afim de alcançar regiões promissoras no espaço de busca. Análises experimentais demonstram a contribuição individual de todos esses componentes. Finalmente, o algoritmo é testado no problema do código de cobertura mínima, que pode ser visto como um caso especial do problema do conjunto dominante. Os códigos são estudados na métrica Hamming e na métrica Rosenbloom-Tsfasman. Neste último, diversos códigos menores foram encontrados.<br>This thesis addresses the Dominating Set Problem, an NP- hard problem with great relevance in applications related to wireless network design, data mining, coding theory, among others. The minimum dominating set in a graph is a minimal set of vertices so that each vertex of the graph belongs to it or is adjacent to a vertex of this set. We study three variants of the problem: first, in the presence of weights on vertices, searching for a dominating set with smallest total weight; second, a variant where the subgraph induced by the dominating set needs to be connected, and,finally, the variant that encompasses these two characteristics. To solve these three problems, we propose a hybrid algorithm based on tabu search with additional mathematical-programming components, leading to a method sometimes called matheuristic. Several additional techniques and large neighborhoods are also employed to reach promising regions in the search space. Our experimental analyses show the good contribution of all these individual components. Finally, the algorithm is tested on the covering code problem, which can be viewed as a special case of the minimum dominating set problem. The codes are studied for the Hamming metric and the Rosenbloom-Tsfasman metric. For this last case, several shorter codes were found.

APA, Harvard, Vancouver, ISO, and other styles

2

Haynes, Teresa W., Michael A. Henning, and Jamie Howard. "Locating and Total Dominating Sets in Trees." Digital Commons @ East Tennessee State University, 2006. https://dc.etsu.edu/etsu-works/3173.

Full text

Abstract:

A set S of vertices in a graph G = (V,E) is a total dominating set of G if every vertex of V is adjacent to a vertex in S. We consider total dominating sets of minimum cardinality which have the additional property that distinct vertices of V are totally dominated by distinct subsets of the total dominating set.

APA, Harvard, Vancouver, ISO, and other styles

3

Howard, Jamie Marie. "Locating and total dominating sets in trees." [Johnson City, Tenn. : East Tennessee State University], 2004. http://etd-submit.etsu.edu/etd/theses/available/etd-0324104-232608/unrestricted/HowardJaime032504b.pdf.

Full text

Abstract:

Thesis (M.S.)--East Tennessee State University, 2004.<br>Title from electronic submission form. ETSU ETD database URN: etd-0324104-232608. Includes bibliographical references. Also available via Internet at the UMI web site.

APA, Harvard, Vancouver, ISO, and other styles

4

Ma, Ka Leung. "In solving the dominating set problem : group theory approach." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape10/PQDD_0005/NQ40311.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Wu, Yiwei. "Connected Dominating Set Construction and Application in Wireless Sensor Networks." Digital Archive @ GSU, 2009. http://digitalarchive.gsu.edu/cs_diss/45.

Full text

Abstract:

Wireless sensor networks (WSNs) are now widely used in many applications. Connected Dominating Set (CDS) based routing which is one kind of hierarchical methods has received more attention to reduce routing overhead. The concept of k-connected m-dominating sets (kmCDS) is used to provide fault tolerance and routing flexibility. In this thesis, we first consider how to construct a CDS in WSNs. After that, centralized and distributed algorithms are proposed to construct a kmCDS. Moreover, we introduce some basic ideas of how to use CDS in other potential applications such as partial coverage and data dissemination in WSNs.

APA, Harvard, Vancouver, ISO, and other styles

6

He, Jing S. "Connected Dominating Set Based Topology Control in Wireless Sensor Networks." Digital Archive @ GSU, 2012. http://digitalarchive.gsu.edu/cs_diss/70.

Full text

Abstract:

Wireless Sensor Networks (WSNs) are now widely used for monitoring and controlling of systems where human intervention is not desirable or possible. Connected Dominating Sets (CDSs) based topology control in WSNs is one kind of hierarchical method to ensure sufficient coverage while reducing redundant connections in a relatively crowded network. Moreover, Minimum-sized Connected Dominating Set (MCDS) has become a well-known approach for constructing a Virtual Backbone (VB) to alleviate the broadcasting storm for efficient routing in WSNs extensively. However, no work considers the load-balance factor of CDSsin WSNs. In this dissertation, we first propose a new concept — the Load-Balanced CDS (LBCDS) and a new problem — the Load-Balanced Allocate Dominatee (LBAD) problem. Consequently, we propose a two-phase method to solve LBCDS and LBAD one by one and a one-phase Genetic Algorithm (GA) to solve the problems simultaneously. Secondly, since there is no performance ratio analysis in previously mentioned work, three problems are investigated and analyzed later. To be specific, the MinMax Degree Maximal Independent Set (MDMIS) problem, the Load-Balanced Virtual Backbone (LBVB) problem, and the MinMax Valid-Degree non Backbone node Allocation (MVBA) problem. Approximation algorithms and comprehensive theoretical analysis of the approximation factors are presented in the dissertation. On the other hand, in the current related literature, networks are deterministic where two nodes are assumed either connected or disconnected. In most real applications, however, there are many intermittently connected wireless links called lossy links, which only provide probabilistic connectivity. For WSNs with lossy links, we propose a Stochastic Network Model (SNM). Under this model, we measure the quality of CDSs using CDS reliability. In this dissertation, we construct an MCDS while its reliability is above a preset applicationspecified threshold, called Reliable MCDS (RMCDS). We propose a novel Genetic Algorithm (GA) with immigrant schemes called RMCDS-GA to solve the RMCDS problem. Finally, we apply the constructed LBCDS to a practical application under the realistic SNM model, namely data aggregation. To be specific, a new problem, Load-Balanced Data Aggregation Tree (LBDAT), is introduced finally. Our simulation results show that the proposed algorithms outperform the existing state-of-the-art approaches significantly.

APA, Harvard, Vancouver, ISO, and other styles

7

Plummer, Andrew Robert. "Characterizations in Domination Theory." Digital Archive @ GSU, 2006. http://digitalarchive.gsu.edu/math_theses/19.

Full text

Abstract:

Let G = (V,E) be a graph. A set R is a restrained dominating set (total restrained dominating set, resp.) if every vertex in V − R (V) is adjacent to a vertex in R and (every vertex in V −R) to a vertex in V −R. The restrained domination number of G (total restrained domination number of G), denoted by gamma_r(G) (gamma_tr(G)), is the smallest cardinality of a restrained dominating set (total restrained dominating set) of G. If T is a tree of order n, then gamma_r(T) is greater than or equal to (n+2)/3. We show that gamma_tr(T) is greater than or equal to (n+2)/2. Moreover, we show that if n is congruent to 0 mod 4, then gamma_tr(T) is greater than or equal to (n+2)/2 + 1. We then constructively characterize the extremal trees achieving these lower bounds. Finally, if G is a graph of order n greater than or equal to 2, such that both G and G' are not isomorphic to P_3, then gamma_r(G) + gamma_r(G') is greater than or equal to 4 and less than or equal to n +2. We provide a similar result for total restrained domination and characterize the extremal graphs G of order n achieving these bounds.

APA, Harvard, Vancouver, ISO, and other styles

8

Coake, Travis Reves. "Using Domination to Analyze RNA Structures." Digital Commons @ East Tennessee State University, 2005. https://dc.etsu.edu/etd/1022.

Full text

Abstract:

Understanding RNA molecules is important to genomics research. Recently researchers at the Courant Institute of Mathematical Sciences used graph theory to model RNA molecules and provided a database of trees representing possible secondary RNA structures. In this thesis we use domination parameters to predict which trees are more likely to exist in nature as RNA structures. This approach appears to have promise in graph theory applications in genomics research.

APA, Harvard, Vancouver, ISO, and other styles

9

Zhou, Dong. "Clock synchronization and dominating set construction in ad hoc wireless networks." Columbus, Ohio : Ohio State University, 2005. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1131725177.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Kim, Kyoung Min Sun Min-Te. "Multi initiator connected dominating set construction for mobile ad hoc networks." Auburn, Ala, 2008. http://hdl.handle.net/10415/1549.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Dominating set"

1

Du, Ding-Zhu. Connected Dominating Set: Theory and Applications. Springer New York, 2013.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

Du, Ding-Zhu, and Peng-Jun Wan. Connected Dominating Set: Theory and Applications. Springer New York, 2013. http://dx.doi.org/10.1007/978-1-4614-5242-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Bourdieu, Pierre. Masculine domination. Stanford University Press, 2001.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

Bourdieu, Pierre. Masculine domination. Polity Press, 2001.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

Bourdieu, Pierre. La domination masculine. Seuil, 1998.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

Dussol, Vincent. La domination féminine: Réflexions sur les rapports entre les sexes. Jean-Claude Gawsewitch, 2011.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

7

La domination féminine: Réflexions sur les rapports entre les sexes. Jean-Claude Gawsewitch, 2011.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

8

Catherine, Marry, ed. Pour en finir avec la domination masculine: De A à Z. Empêcheurs de penser en rond, 2007.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

Die Verkehrung: Das Projekt des Patriarchats und das Gender-Dilemma. Promedia, 2011.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

10

De "l'ennemi principal" aux principaux ennemis: Position vécue, subjectivité et conscience masculines de domination. L'Harmattan, 2010.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Dominating set"

1

Kao, Ming-Yang. "Dominating Set." In Encyclopedia of Algorithms. Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-30162-4_119.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Cheng, Xiuzhen, Feng Wang, and Ding-Zhu Du. "Connected Dominating Set." In Encyclopedia of Algorithms. Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-30162-4_89.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Wang, Feng, Ding-Zhu Du, and Xiuzhen Cheng. "Connected Dominating Set." In Encyclopedia of Algorithms. Springer New York, 2016. http://dx.doi.org/10.1007/978-1-4939-2864-4_89.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Wang, Feng, Ding-Zhu Du, and Xiuzhen Cheng. "Connected Dominating Set." In Encyclopedia of Algorithms. Springer US, 2014. http://dx.doi.org/10.1007/978-3-642-27848-8_89-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Fang, Qizhi, Hye Kyung Kim, and Dae Sik Lee. "Total Dominating Set Games." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11600930_52.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Wang, Yu, Weizhao Wang, and Xiang-Yang Li. "Weighted Connected Dominating Set." In Encyclopedia of Algorithms. Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-30162-4_476.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Wang, Yu, Weizhao Wang, and Xiang-Yang Li. "Weighted Connected Dominating Set." In Encyclopedia of Algorithms. Springer New York, 2016. http://dx.doi.org/10.1007/978-1-4939-2864-4_476.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Zhao, Zhang. "Strongly Connected Dominating Set." In Encyclopedia of Algorithms. Springer New York, 2016. http://dx.doi.org/10.1007/978-1-4939-2864-4_619.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Kanté, Mamadou Moustapha, and Lhouari Nourine. "Minimal Dominating Set Enumeration." In Encyclopedia of Algorithms. Springer New York, 2016. http://dx.doi.org/10.1007/978-1-4939-2864-4_721.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Zhao, Zhang. "Strongly Connected Dominating Set." In Encyclopedia of Algorithms. Springer US, 2014. http://dx.doi.org/10.1007/978-3-642-27848-8_619-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Dominating set"

1

Yu, Dongxiao, Yifei Zou, Yong Zhang, et al. "Distributed Dominating Set and Connected Dominating Set Construction Under the Dynamic SINR Model." In 2019 IEEE International Parallel and Distributed Processing Symposium (IPDPS). IEEE, 2019. http://dx.doi.org/10.1109/ipdps.2019.00092.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Wang, Guangyuan, Hua Wang, Xiaohui Tao, Ji Zhang, Xun Yi, and Jianming Yong. "Positive Influence Dominating Set Games." In 2014 IEEE 18th International Conference on Computer Supported Cooperative Work in Design (CSCWD). IEEE, 2014. http://dx.doi.org/10.1109/cscwd.2014.6846890.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Yang, Zhi, Pengfei Li, Yanxiang Bao, and Xiao Huang. "A Multi-Dominating-Subtree-based Minimum Connected Dominating Set Construction Algorithm." In 2019 IEEE 4th Advanced Information Technology, Electronic and Automation Control Conference (IAEAC). IEEE, 2019. http://dx.doi.org/10.1109/iaeac47372.2019.8997653.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Kuhn, Fabian, and Roger Wattenhofer. "Constant-time distributed dominating set approximation." In the twenty-second annual symposium. ACM Press, 2003. http://dx.doi.org/10.1145/872035.872040.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Zhu, Junmin. "Approximation for minimum total dominating set." In the 2nd International Conference. ACM Press, 2009. http://dx.doi.org/10.1145/1655925.1655948.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Mandal, Subhrangsu, and Arobinda Gupta. "Permanent dominating set on dynamic graphs." In 2016 8th International Conference on Communication Systems and Networks (COMSNETS). IEEE, 2016. http://dx.doi.org/10.1109/comsnets.2016.7439959.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Gewali, L., K. Mohamad, and Min Tun. "Interference Aware Dominating Set for Sensor Network." In Third International Conference on Information Technology: New Generations (ITNG'06). IEEE, 2006. http://dx.doi.org/10.1109/itng.2006.79.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Lu Li, Xingyu Wang, Xingsheng Gu, and Xiang Xiao. "Generalized dominating set and its evolutionary algorithm." In 2011 International Conference on Computer Science and Service System (CSSS). IEEE, 2011. http://dx.doi.org/10.1109/csss.2011.5974413.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Vakili, Sattar, and Qing Zhao. "Distributed node-weighted connected dominating set problems." In 2013 Asilomar Conference on Signals, Systems and Computers. IEEE, 2013. http://dx.doi.org/10.1109/acssc.2013.6810267.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Wu, Kaiwen, Baoan Ren, Hongfu Liu, and Jing Chen. "Minimum Distance Dominating Set in Complex Networks." In 2018 37th Chinese Control Conference (CCC). IEEE, 2018. http://dx.doi.org/10.23919/chicc.2018.8484008.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Dominating set"

1

Ogier, R., and P. Spagnolo. Mobile Ad Hoc Network (MANET) Extension of OSPF Using Connected Dominating Set (CDS) Flooding. RFC Editor, 2009. http://dx.doi.org/10.17487/rfc5614.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Incongruity between biological and chronologic age among the pupils of sports schools and the problem of group lessons effectiveness at the initial stage of training in Greco-Roman wrestling. Aleksandr S. Kuznetsov, 2021. http://dx.doi.org/10.14526/2070-4798-2021-16-1-19-23.

Full text

Abstract:

Considerable influence and compulsory dropout among those, who go in for GrecoRoman wrestling at the age of 10-13, does not take into account the level of individual biological development and integral demands domination claimed on too high general physical training (GPT) (4) normatives fulfillment. It corresponds with general situation in the system of education (6, 9). In spite of uneven speed of biological development (1, 8, 9), there are general demands claimed on physical training at school for age groups (5) in accordance with chronologic age. The same situation is at sports schools. Technical and physical training lessons at Greco-Roman wrestling school at the stage of initial training are organized according to general group principle. Research methods. Information sources analysis and summarizing, questionnaire survey, coaches’ experience summarizing, methods of mathematical statistics. Results. The received research results led to the following conclusion: it is possible to solve the problem of dropping out of Greco-Roman wrestling sports schools in terms of minimal loss in the quality of sports training by means of dividing the training groups into subgroups. There different normatives of material mastering and set by standard physical qualities development are used. For this purpose we created the training groups and subgroups of the set objectives realization at Greco-Roman wrestling sports schools.

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!