Suggested Topics within your search.
Suggested Topics within your search.
History of engineering and technology
3
Mathematics & science
2
QA75.5-76.95 Electronic computers. Computer science
2
Research & information: general
2
Bi-regular graphs
1
Concept hierarchy
1
Connected Dominating Set
1
Connected domination number
1
Dominating set problem (DSP)
1
Dominating uniqueness
1
Domination
1
Domination polynomial
1
Doubly connected domination number
1
Electric energies
1
Electric power transmission networks
1
Electricity loss
1
Energy transfer
1
Gossiping problem
1
Graph theory
1
Graphic methods
1
Grid graphs
1
Information retrieval
1
Knödel graph
1
Monophonic
1
QA Mathematics
1
Rectangular grid graph
1
Rectangular grids
1
Regular graphs
1
Security
1
Smart grid
1
-
561Algorithmes et résultats de complexité pour des problèmes de graphes avec contraintes additionnellesby Cornet, Alexis“... (dominating set, independant dominating set, ...) as well as covering problems (vertex-cover, Steiner tree...”
Published 2018
Get full text
-
562by JING-HAN DENG, 鄧經翰“... concepts coverage). Then we transform the test sheet composing optimization problem into a dominating set...”
Get full text
Others -
563“...<p>A subset <em>D</em> ⊆ <em>V</em>(<em>G</em>) is called a <em>k</em>-distance dominating set...”
Get full text
Article -
564“...Let \(p\) be a positive integer and \(G =(V(G),E(G))\) a graph. A \(p\)-dominating set of \(G...”
Get full text
Article -
565“... $S$ is called global if it forms a dominating set. The global defensive alliance number of a graph $G...”
Get full text
Article -
566by Yu, Ying“... with the bandwidth limitation problem, the Dominating Set Based and Multi-Recipient routing are adopted, so...”
Published 2004
Get full text
Get full text
Others -
567by Yan, Shuo“... coverage and localized connected dominating set algorithms to achieve two more resilient DEDA...”
Published 2011
Get full text
-
568by Yan, Shuo“... coverage and localized connected dominating set algorithms to achieve two more resilient DEDA...”
Published 2011
Get full text
-
569“...A subset $S$ of vertices of a graph $G$ is a hop dominating set if every vertex outside...”
Get full text
Article -
570by Yan, Shuo“... coverage and localized connected dominating set algorithms to achieve two more resilient DEDA...”
Published 2011
Get full text
-
571“... critical proteins in probabilistic complex networks, in the context of a minimum dominating set...”
Get full text
Article -
572“... alliance S is global if S forms a dominating set of G. The first subject of this dissertation is to propose...”
Get full text
Others -
573by Faul, Peter“...Let G be a graph with vertex set V (G) and edge set E(G). A dominating set S of a graph G is a...”
Published 2017
Get full text
Dissertation -
574“... those nodes with zero EDDP from the candidate dominator set to construct a reliable connected dominating...”
Get full text
Article -
575by Agarwal, Radhika“... and reconfigurable system. We achieve this by leveraging the concept of virtual dominating set to create an overlay...”
Published 2014
Get full text
-
576by Mini-Lun Tsai, 蔡明倫“... of forward nodes; called MCDS (Minimum connected dominating set). But the problem to find MCDS has been...”
Get full text
Others -
577“... S of vertices in G is a disjunctive total dominating set of G if every vertex is adjacent to a vertex...”
Get full text
Article -
578“...; the heuristic solution is to find the Minimum Connected Dominating Sets (MCDS) to achieve an optimal...”
Get full text
Others -
579by Yan, Shuo“... coverage and localized connected dominating set algorithms to achieve two more resilient DEDA...”
Published 2011
Get full text
Get full text
-
580by Ghaffari, Mohsen“... dissemination, minimum-weight connected dominating set, and scheduling distributed protocols. We develop novel...”
Published 2017
Get full text
Others