Results 231 to 240 of about 8,068,470 (244)
Some of the next articles are maybe not open access.
Weakly connected resolving sets in graphs
Discrete Mathematics, Algorithms and ApplicationsHarary and Melter introduced the concept of resolving sets in graphs. Slater stated the term locating set and the minimum resolving set as reference sets. Chartrand mentioned the locating set as a resolving set and the minimum cardinality of a resolving set as metric dimension or simply dimension in later stage.
J. Sivakumar +3 more
openaire +2 more sources
Resolving Resistances to Immediacy in the Group Setting
International Journal of Group Psychotherapy, 1993This article presents interventions appropriate to three forms of resistance commonly encountered in the group. One is the tendency of members to talk in the past tense instead of the present. A second is the disposition of members to dwell on the future. The third is their tendency to occupy the group with issues in their outside lives. Also mentioned
openaire +2 more sources
Algorithmic aspect on the minimum (weighted) doubly resolving set problem of graphs
Journal of combinatorial optimization, 2019Changhong Lu, Qingjie Ye, Chengru Zhu
semanticscholar +1 more source
FEEDBACK RESOLVING SETS IN GRAPHS
Advances in Mathematics: Scientific Journal, 2020M. Rajeswari, A. Anitha, I. Sahul Hamid
openaire +1 more source
Variable neighborhood search for metric dimension and minimal doubly resolving set problems
European Journal of Operational Research, 2011N. Mladenović +3 more
semanticscholar +1 more source
Ambidexterity as a Dynamic Capability: Resolving the Innovator's Dilemma
, 2007C. O'Reilly, M. Tushman
semanticscholar +1 more source