Results 291 to 300 of about 623,562 (309)
Acyclic and star coloring parameters of fractal cubic networks. [PDF]
Renuga C +3 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Domination and Total Domination in Hypergraphs
2020A dominating set in a hypergraph H with vertex set V (H) and E(H) is a subset of vertices D ⊆ V (H) such that for every vertex v ∈ V (H) ∖ D, there exists an edge e ∈ E(H) for which v ∈ e and e ∩ D≠∅. A total dominating set in H is a dominating set D of H with the additional property that for every vertex v in D, there exists an edge e ∈ E(H) for which
Henning, Michael A., Yeo, Anders
openaire +3 more sources
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
2020
This chapter examines the hegemony of white masculinity and critiques the imperialist fantasy of white masculine dominance, strength and power. This historical image bestowed white men the right to command and control humanity, which translates in contemporary organisational practice to the abiding association of white masculinity with leadership ...
openaire +1 more source
This chapter examines the hegemony of white masculinity and critiques the imperialist fantasy of white masculine dominance, strength and power. This historical image bestowed white men the right to command and control humanity, which translates in contemporary organisational practice to the abiding association of white masculinity with leadership ...
openaire +1 more source
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 +3 more sources

