Results 291 to 300 of about 407,618 (322)
Some of the next articles are maybe not open access.
1997
A walk in a graph G is a finite sequence of vertices x 0, x 1, ..., x n and edges a 1, a 2, ..., a n of G: $${x_0},{a_1},{x_1},{a_2}, \ldots ,{a_n},{x_n},$$ where the endpoints of a i are x i−1 and x i for each i. A simple walk is a walk in which no edge is repeated.
openaire +1 more source
A walk in a graph G is a finite sequence of vertices x 0, x 1, ..., x n and edges a 1, a 2, ..., a n of G: $${x_0},{a_1},{x_1},{a_2}, \ldots ,{a_n},{x_n},$$ where the endpoints of a i are x i−1 and x i for each i. A simple walk is a walk in which no edge is repeated.
openaire +1 more source
Simple Paths and Cycles Avoiding Forbidden Paths
2017A graph with forbidden paths is a pair (G, F) where G is a graph and F is a subset of the set of paths in G. A simple path avoiding forbidden paths in (G, F) is a simple path in G such that each subpath is not in F. It is shown in [S. Szeider, Finding paths in graphs avoiding forbidden transitions, DAM 126] that the problem of deciding the existence of
openaire +1 more source
1998
Traditional network location theory is concerned with the optimal location of facilities which can be considered as single points (emergency medical service stations, switching centers in communication networks, bus stops, mail boxes, etc.) However, in many real problems the facility to be located is too large to be modeled as a point. Examples of such
Labbé, Martine +2 more
openaire +1 more source
Traditional network location theory is concerned with the optimal location of facilities which can be considered as single points (emergency medical service stations, switching centers in communication networks, bus stops, mail boxes, etc.) However, in many real problems the facility to be located is too large to be modeled as a point. Examples of such
Labbé, Martine +2 more
openaire +1 more source
Finding Paths and Cycles of Superpolylogarithmic Length
SIAM Journal on Computing, 2004Let $\ell$ be the number of edges in a longest cycle containing a given vertex $v$ in an undirected graph. We show how to find a cycle through $v$ of length $\exp(\Omega(\sqrt {\log \ell/\log\log \ell}))$ in polynomial time. This implies the same bound for the longest cycle, longest $vw$-path, and longest path.
openaire +1 more source
Long Paths and Cycles in Dynamical Graphs
Journal of Statistical Physics, 2003zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Paths, cycles, and arc‐connectivity in digraphs
Journal of Graph Theory, 1995AbstractIn this paper we prove the following theorem: Let D be a k‐arcconnected digraph (multiple arcs allowed). If x is a vertex of D and / is an integer with / ≤ k, then for any / disjoint arc pairs {f1, g1}, ⃛, {f1, g1}, where f1, ⃛, f1 are arcs with head at x and g1, ⃛, g1 are arcs with tail at x, there exist in D / arc‐disjoint cycles C1 ...
openaire +1 more source
Antibiotic resistance in the patient with cancer: Escalating challenges and paths forward
Ca-A Cancer Journal for Clinicians, 2021Amila K Nanayakkara +2 more
exaly
Alternating cycle covers and paths
1981The boundary between the class P (problems solvable in polynomial time) and the class of NP-complete problems (probably not solvable in polynomial time) is investigated in the area of alternating cycle covers and alternating paths. By means of logarithm space reductions it is shown, that the transition from undirected graphs to directed graphs causes a
openaire +1 more source
Climate change impacts on plant pathogens, food security and paths forward
Nature Reviews Microbiology, 2023Brajesh K Singh +2 more
exaly