Results 31 to 40 of about 13,357,344 (331)
Approximability of the Minimum Weighted Doubly Resolving Set Problem [PDF]
International Computing and Combinatorics Conference, 2014 Locating source of diffusion in networks is crucial for controlling and preventing epidemic risks. It has been studied under various probabilistic models.
Xujin Chen, Xiao-Dong Hu, Changjun Wang
semanticscholar +1 more source
Resolving the Optimal Metric Distortion Conjecture [PDF]
IEEE Annual Symposium on Foundations of Computer Science, 2020 We study the following metric distortion problem: there are two finite sets of points, V and C, that lie in the same metric space, and our goal is to choose a point in C whose total distance from the points in V is as small as possible.
Vasilis Gkatzelis +2 more
semanticscholar +1 more source
Semiclassical resolvent estimates at trapped sets [PDF]
Annales de l'Institut Fourier, 2012 We extend our recent results on propagation of semiclassical resolvent estimates through trapped sets when a priori polynomial resolvent bounds hold. Previously we obtained non-trapping estimates in trapping situations when the resolvent was sandwiched between cutoffs χ
Datchev, Kiril, Vasy, András
openaire +2 more sources
Characterisation of a Holliday junction-resolving enzyme from Schizosaccharomyces pombe [PDF]
, 2014 We thank the Cancer Research Campaign for financial support.The rearrangement and repair of DNA by homologous recombination involves the creation of Holliday junctions, which are cleaved by a class of junction-specific endonucleases to generate ...
Lilley, DMJ, White, Malcolm Frederick
core +2 more sources
On Resolvability- and Domination-Related Parameters of Complete Multipartite Graphs
Mathematics, 2022 Graphs of order n with fault-tolerant metric dimension n have recently been characterized.This paper points out an error in the proof of this characterization. We show that the complete multipartite graphs also have the fault-tolerant metric dimension n,
Sakander Hayat, Asad Khan, Yubin Zhong
doaj +1 more source
Application of Metric Dimensions to Minimize the Installation of Fire Sensors on The Rectorate Building of Pasifik Morotai University [PDF]
MATEC Web of Conferences, 2022 The metric dimension of the connected graph G for each 𝑣 𝜖 𝑉(𝐺) to the set W is . The set r (ν|W) = (d(ν, w1), d(ν,w2),…d(ν,wk) W is called the resolving set if every vertex u,v in G, if u ≠ ν , then r (u|W) ≠ r (ν|W) .
Parera Cicilya Orissa F. +3 more
doaj +1 more source
Benchmarking photon number resolving detectors. [PDF]
Optics Express, 2020 Photon number resolving detectors are the ultimate measurement of quantum optics, which is the reason why developing the technology is getting significant attention in recent years.
Jan Provazník +3 more
semanticscholar +1 more source
Determining Sets, Resolving Sets, and the Exchange Property [PDF]
Graphs and Combinatorics, 2009 A subset U of vertices of a graph G is called a determining set if every automorphism of G is uniquely determined by its action on the vertices of U. A subset W is called a resolving set if every vertex in G is uniquely determined by its distances to the vertices of W. Determining (resolving) sets are said to have the exchange property in G if whenever
openaire +2 more sources
Bounds on the domination number and the metric dimension of co-normal product of graphs
Journal of Inequalities and Applications, 2018 In this paper, we establish bounds on the domination number and the metric dimension of the co-normal product graph GH $G_{H}$ of two simple graphs G and H in terms of parameters associated with G and H.
Imran Javaid +2 more
doaj +1 more source
Progress Toward Resolving the Attentional Capture Debate
Visual Cognition, 2020 For over 25 years, researchers have debated whether physically salient stimuli capture attention in an automatic manner, independent of the observer’s goals, or whether the capture of attention depends on the match between a stimulus and the observer’s ...
S. Luck +4 more
semanticscholar +1 more source