نتایج جستجو برای: paths

تعداد نتایج: 53279  

Mayamma Joseph, S.R. Shreyas

If G = (V, E, σ) is a finite signed graph, a function f : V → {−1, 0, 1} is a minusdominating function (MDF) of G if f(u) +summation over all vertices v∈N(u) of σ(uv)f(v) ≥ 1 for all u ∈ V . In this paper we characterize signed paths and cycles admitting an MDF.

We address the following problem: Given a simple polygon $P$ with $n$ vertices and two points $s$ and $t$ inside it, find a minimum link path between them such that a given target point $q$ is visible from at least one point on the path. The method is based on partitioning a portion of $P$ into a number of faces of equal link distance from a source point. This partitioning is essentially a shor...

Journal: :Discrete Mathematics 1993

Journal: :Journal of Peace Research 2015

Journal: :Physical Review Letters 2020

Journal: :Physics Letters A 2013

Journal: :Computational Geometry 2001

Journal: :Biochemistry and Molecular Biology Education 2005

Journal: :Journal of Combinatorial Theory, Series B 1996

Journal: :Journal of Functional Analysis 2004

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید