Relevant bibliographies by topics / Counting dominating sets

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters

Academic literature on the topic 'Counting dominating sets'

Author: Grafiati
Published: 4 June 2021
Last updated: 7 February 2022

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 'Counting dominating sets.'

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 "Counting dominating sets"

1

Casinillo, Leomarich F. "NEW COUNTING FORMULA FOR DOMINATING SETS IN PATH AND CYCLE GRAPHS." Journal of Fundamental Mathematics and Applications (JFMA) 3, no. 2 (2020): 170–77. http://dx.doi.org/10.14710/jfma.v3i2.9325.

Full text
Abstract:
Let G=(V(G), E(G)) be a path or cycle graph. A subset D of V(G) is a dominating set of G if for every u element of V(G)\D, there exists v element of D such that uv element of E(G), that is, N[D]=V(G). The domination number of G, denoted by gamma(G), is the smallest cardinality of a dominating set of G. A set D_1 subset of V(G) is a set containing dominating vertices of degree 2, that is, each vertex is internally stable. A set D_2 subset of V(G) is a set containing dominating vertices where one of the element say a element of D_2, and the rest are of degree 2. A set D_3 subset of V(G) is a set
APA, Harvard, Vancouver, ISO, and other styles
2

Borissevich, Kristina, and Tomislav Doslic. "Counting dominating sets in cactus chains." Filomat 29, no. 8 (2015): 1847–55. http://dx.doi.org/10.2298/fil1508847b.

Full text
Abstract:
In this paper we consider the number of dominating sets in cactus chains with triangular and square blocks. We derive and solve the recurrences satisfied by those quantities and investigate their asymptotic behavior. In triangular case we also refine the counting by computing the bivariate generating function. As a corollary, we compute the expected size of a dominating set in a triangular cactus chain of a given length.
APA, Harvard, Vancouver, ISO, and other styles
3

Lin, Min-Sheng. "Counting dominating sets in generalized series-parallel graphs." Discrete Mathematics, Algorithms and Applications 11, no. 06 (2019): 1950074. http://dx.doi.org/10.1142/s1793830919500745.

Full text
Abstract:
Counting dominating sets in a graph is a #P-complete problem even in planar graphs. This paper studies this problem for generalized series-parallel graphs, which are a subclass of planar graphs. This work develops some linear-time algorithms for counting dominating sets and their two variants, independent dominating sets and connected dominating sets in generalized series-parallel graphs.
APA, Harvard, Vancouver, ISO, and other styles
4

Cutler, Jonathan, and A. J. Radcliffe. "Counting dominating sets and related structures in graphs." Discrete Mathematics 339, no. 5 (2016): 1593–99. http://dx.doi.org/10.1016/j.disc.2015.12.011.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Aledo, Juan A., Ali Barzanouni, Ghazaleh Malekbala, Leila Sharifan, and Jose C. Valverde. "Counting Periodic Points in Parallel Graph Dynamical Systems." Complexity 2020 (September 14, 2020): 1–9. http://dx.doi.org/10.1155/2020/9708347.

Full text
Abstract:
Let F:0,1n⟶0,1n be a parallel dynamical system over an undirected graph with a Boolean maxterm or minterm function as a global evolution operator. It is well known that every periodic point has at most two periods. Actually, periodic points of different periods cannot coexist, and a fixed point theorem is also known. In addition, an upper bound for the number of periodic points of F has been given. In this paper, we complete the study, solving the minimum number of periodic points’ problem for this kind of dynamical systems which has been usually considered from the point of view of complexity
APA, Harvard, Vancouver, ISO, and other styles
6

Johnston, Ron, Colin Rallings, and Michael Thrasher. "Electoral Success, Electoral Bias, and Labour Hegemony: Electoral System Effects in English Metropolitan Boroughs." Environment and Planning A: Economy and Space 34, no. 7 (2002): 1303–17. http://dx.doi.org/10.1068/a3535.

Full text
Abstract:
Since their first elections in 1973, the thirty-six metropolitan borough councils in England's six metropolitan counties have been dominated by the Labour Party. In part, this domination reflects the normal exaggerative features of the first-past-the-post electoral system: the largest party in terms of vote share tends to get a diproportionate share of the seats. As well as an exaggeration effect, however, that electoral system is also prone to produce biased outcomes—in that with the same share of the votes cast one party tends to perform much better than the other. This has been the case in
APA, Harvard, Vancouver, ISO, and other styles
7

Lin, Min-Sheng. "Fast and simple algorithms for counting dominating sets in distance-hereditary graphs." Discrete Mathematics, Algorithms and Applications, October 5, 2020, 2150012. http://dx.doi.org/10.1142/s1793830921500129.

Full text
Abstract:
Counting dominating sets (DSs) in a graph is a #P-complete problem even for chordal bipartite graphs and split graphs, which are both subclasses of weakly chordal graphs. This paper investigates this problem for distance-hereditary graphs, which is another known subclass of weakly chordal graphs. This work develops linear-time algorithms for counting DSs and their two variants, total DSs and connected DSs in distance-hereditary graphs.
APA, Harvard, Vancouver, ISO, and other styles
8

Conant, Gabriel, and Anand Pillay. "Pseudofinite groups and VC-dimension." Journal of Mathematical Logic, November 2, 2020, 2150009. http://dx.doi.org/10.1142/s0219061321500094.

Full text
Abstract:
We develop “local NIP group theory” in the context of pseudofinite groups. In particular, given a sufficiently saturated pseudofinite structure [Formula: see text] expanding a group, and left invariant NIP formula [Formula: see text], we prove various aspects of “local fsg” for the right-stratified formula [Formula: see text]. This includes a [Formula: see text]-type-definable connected component, uniqueness of the pseudofinite counting measure as a left-invariant measure on [Formula: see text]-formulas and generic compact domination for [Formula: see text]-definable sets.
APA, Harvard, Vancouver, ISO, and other styles
9

Lambert, Anthony, and Elaine Kelly. "Coalition." M/C Journal 13, no. 6 (2010). http://dx.doi.org/10.5204/mcj.327.

Full text
Abstract:
"Birds of a feather (and colour) will flock (and fly) together." — Old English Proverb, 1545 (approx) While the notion of the 'coalition' is one normally associated with formalised alliances between political parties, coalitional affiliations are not limited to mainstream politics, and instead share a focus on strategy and outcome across the full range of human endeavours. Parties with varying priorities will put to one side their differences in order to focus on overlapping concerns. Thus coalitions come in all shapes and sizes and cross all walks of life: from families, clubs and teams to fr
APA, Harvard, Vancouver, ISO, and other styles
10

Mackenzie, Adrian. "Making Data Flow." M/C Journal 5, no. 4 (2002). http://dx.doi.org/10.5204/mcj.1975.

Full text
Abstract:
Why has software code become an object of intense interest in several different domains of cultural life? In art (.net art or software art), in Open source software (Linux, Perl, Apache, et cetera (Moody; Himanen)), in tactical media actions (hacking of WEF Melbourne and Nike websites), and more generally, in the significance attributed to coding as work at the pinnacle of contemporary production of information (Negri and Hardt 298), code itself has somehow recently become significant, at least for some subcultures. Why has that happened? At one level, we could say that this happened because i
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Counting dominating sets"

1

Talon, Alexandre. "Intensive use of computing resources for dominations in grids and other combinatorial problems." Thesis, Lyon, 2019. http://www.theses.fr/2019LYSEN079.

Full text
Abstract:
Nous cherchons à prouver de nouveaux résultats en théorie des graphes et combinatoire grâce à la vitesse de calcul des ordinateurs, couplée à des algorithmes astucieux. Nous traitons quatre problèmes. Le théorème des quatre couleurs affirme que toute carte d’un monde où les pays sont connexes peut être coloriée avec 4 couleurs sans que deux pays voisins aient la même couleur. Il a été le premier résultat prouvé en utilisant l'ordinateur, en 1989. Nous souhaitions automatiser encore plus cette preuve. Nous expliquons la preuve et fournissons un programme qui permet de la réétablir, ainsi que d'
APA, Harvard, Vancouver, ISO, and other styles
2

Bergougnoux, Benjamin. "Matrix decompositions and algorithmic applications to (hyper)graphs." Thesis, Université Clermont Auvergne‎ (2017-2020), 2019. http://www.theses.fr/2019CLFAC025/document.

Full text
Abstract:
Durant ces dernières décennies, d'importants efforts et beaucoup de café ont été dépensés en vue de caractériser les instances faciles des problèmes NP-difficiles. Dans ce domaine de recherche, une approche s'avère être redoutablement efficace : la théorie de la complexité paramétrée introduite par Downey et Fellows dans les années 90.Dans cette théorie, la complexité d'un problème n'est plus mesurée uniquement en fonction de la taille de l'instance, mais aussi en fonction d'un paramètre .Dans cette boite à outils, la largeur arborescente est sans nul doute un des paramètres de graphe les plus
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Counting dominating sets"

1

Kanté, Mamadou Moustapha, and Takeaki Uno. "Counting Minimal Dominating Sets." In Lecture Notes in Computer Science. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-55911-7_24.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

van Rooij, Johan M. M. "Polynomial Space Algorithms for Counting Dominating Sets and the Domatic Number." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-13073-1_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Kanté, Mamadou Moustapha, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, and Takeaki Uno. "On the Enumeration and Counting of Minimal Dominating sets in Interval and Permutation Graphs." In Algorithms and Computation. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-45030-3_32.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Gaspers, Serge, and Gregory B. Sorkin. "Separate, Measure and Conquer: Faster Polynomial-Space Algorithms for Max 2-CSP and Counting Dominating Sets." In Automata, Languages, and Programming. Springer Berlin Heidelberg, 2015. http://dx.doi.org/10.1007/978-3-662-47672-7_46.

Full text
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!

To the bibliography