Results 221 to 230 of about 200,043 (266)

Past Performance as a Predictor of Future Success: Deciphering the Research "Arms Race" in Plastic Surgery Applicants. [PDF]

Plast Surg (Oakv)
Gupta S.
europepmc   +1 more source

Scientific misconduct, questionable research practices, and research climate: empirical approaches to integrity problems. [PDF]

Res Integr Peer Rev
Nazarovets S.
europepmc   +1 more source

Lessons from a 'low-tech' community approach to youth mental health in Argentina: shared space, purpose and stories. [PDF]

Lancet Reg Health Am
Buedo P, Daly T.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

On loops, dominators, and dominance frontier

Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation, 2000
This 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

On the Domination Integrity

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

Generalized dominators and post-dominators

Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '92, 1992
The 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