Results 81 to 90 of about 29,873 (120)
Some of the next articles are maybe not open access.
Related searches:
Related searches:
On loops, dominators, and dominance frontier
Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation, 2000This article explores the concept of loops and loop nesting forests of control-flow graphs, using the problem of constructing the dominator tree of a graph and the problem of computing the iterated dominance frontier of a set of vertices in a graph as guiding applications. The contributions of this article include: (1) An axiomatic characterization, as
openaire +1 more source
International Journal of Foundations of Computer Science, 2019
The domination integrity of graph G is defined by [Formula: see text] where [Formula: see text] denotes the order of the largest component in [Formula: see text]. This parameter is a measures of vulnerability of a graph. In this paper, we determine the domination integrity of middle graph of graph [Formula: see text], graph [Formula: see text] and ...
Hüseyin Tokat, Alpay Kirlangiç
openaire +1 more source
The domination integrity of graph G is defined by [Formula: see text] where [Formula: see text] denotes the order of the largest component in [Formula: see text]. This parameter is a measures of vulnerability of a graph. In this paper, we determine the domination integrity of middle graph of graph [Formula: see text], graph [Formula: see text] and ...
Hüseyin Tokat, Alpay Kirlangiç
openaire +1 more source
Generalized dominators and post-dominators
Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '92, 1992The notion of dominators is generalized to include multiple-vertex dominators in addition to single-vertex dominators. A multiple-vertex dominator of a vertex is a group of vertices that collectively dominate the vertex. Existing algorithms compute immediate single-vertex dominators, and an algorithm for computing immediate multiple-vertex dominators ...
openaire +1 more source
, 2008 The concept of stochastic dominance is defined, and its relation to welfare, poverty, and income inequality explained. A brief discussion is provided of how statistical inference may be performed for hypotheses relating to stochastic dominance.
openaire +1 more source
2019
Inspired by the feedback scenario, which characterizes online social networks, we introduce a novel domination problem, which we call Dual Domination (DD). We assume that the nodes in the input network are partitioned into two categories: Positive nodes (V+) and negative nodes (V-).
Gennaro Cordasco +2 more
openaire +3 more sources
Inspired by the feedback scenario, which characterizes online social networks, we introduce a novel domination problem, which we call Dual Domination (DD). We assume that the nodes in the input network are partitioned into two categories: Positive nodes (V+) and negative nodes (V-).
Gennaro Cordasco +2 more
openaire +3 more sources
A note on domination and total domination in prisms
Journal of Combinatorial Optimization, 2017Let \(G=(V,E)\) be a simple graph. A subset \(S \subseteq V\) is a dominating set if every vertex \(v \in V\setminus S\) is adjacent to a vertex in S. The minimum cardinality of a dominating set, denoted by \(\gamma(G)\), called the domination number of graph \(G\).
Wayne Goddard, Michael A. Henning
openaire +2 more sources
Double domination and super domination in trees
Discrete Mathematics, Algorithms and Applications, 2016A vertex of a graph [Formula: see text] is said to dominate itself and all its neighbors. A double dominating set (DDS) of a graph [Formula: see text] is a set [Formula: see text] of vertices such that every vertex of [Formula: see text] is dominated by at least two vertices of [Formula: see text]. The double domination number of a graph [Formula: see
B. Krishnakumari +1 more
openaire +1 more source
Domination and total domination in complementary prisms
Journal of Combinatorial Optimization, 2008zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Teresa W. Haynes +2 more
openaire +2 more sources
Developmental Medicine & Child Neurology, 1972
SUMMARYLaterality, hand preference and cerebral dominance are terms which are often used synonymously. They should be differentiated, however. A review of the literature demonstrates much (often eclectic) knowledge which is often not directly applicable clinically.
openaire +3 more sources
SUMMARYLaterality, hand preference and cerebral dominance are terms which are often used synonymously. They should be differentiated, however. A review of the literature demonstrates much (often eclectic) knowledge which is often not directly applicable clinically.
openaire +3 more sources