Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "path" wg kryterium: Temat

  Lista filtrów

Dostawca treści

Wyrównaj
Wyświetlanie 1-15 z 544
Tytuł:
On k-Path Pancyclic Graphs
Autorzy:
Bi, Zhenming
Zhang, Ping
Powiązania:
https://bibliotekanauki.pl/articles/31339488.pdf
Data publikacji:
2015-05-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
Hamiltonian
panconnected
pancyclic
path Hamiltonian
path pancyclic
Opis:
For integers k and n with 2 ≤ k ≤ n − 1, a graph G of order n is k-path pancyclic if every path P of order k in G lies on a cycle of every length from k + 1 to n. Thus a 2-path pancyclic graph is edge-pancyclic. In this paper, we present sufficient conditions for graphs to be k-path pancyclic. For a graph G of order n ≥ 3, we establish sharp lower bounds in terms of n and k for (a) the minimum degree of G, (b) the minimum degree-sum of nonadjacent vertices of G and (c) the size of G such that G is k-path pancyclic
Źródło:
Discussiones Mathematicae Graph Theory; 2015, 35, 2; 271-281
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On independent sets and non-augmentable paths in directed graphs
Autorzy:
Galeana-Sánchez, H.
Powiązania:
https://bibliotekanauki.pl/articles/744219.pdf
Data publikacji:
1998
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
digraph
independent set
directed path
non-augmentable path
Opis:
We investigate sufficient conditions, and in case that D be an asymmetrical digraph a necessary and sufficient condition for a digraph to have the following property: "In any induced subdigraph H of D, every maximal independent set meets every non-augmentable path". Also we obtain a necessary and sufficient condition for any orientation of a graph G results a digraph with the above property. The property studied in this paper is an instance of the property of a conjecture of J.M. Laborde, Ch. Payan and N.H. Huang: "Every digraph contains an independent set which meets every longest directed path" (1982).
Źródło:
Discussiones Mathematicae Graph Theory; 1998, 18, 2; 171-181
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Changing the development path of a region - a case study of the Lower Silesian Voivodeship
Autorzy:
Peszat, Klaudia
Szlachta, Jacek
Powiązania:
https://bibliotekanauki.pl/articles/2108241.pdf
Data publikacji:
2017-07-10
Wydawca:
Uniwersytet Warszawski. Wydział Geografii i Studiów Regionalnych
Tematy:
Regional development
innovation
regional development path
path dependency
Opis:
A case study of the Lower Silesian Voivodeship is presented in this article. From the European Union's perspective, Lower Silesia is an example of a less developed region; however, it is also an example of a region that has improved significantly in regards to development due to a change in its innovation model. The purpose of this article is to identify the factors that have had an impact on the change in the region's development path (stimulants), as well as to indicate the weaknesses and barriers limiting further development. This article is based on a review of the literature, statistical data analysis as well as structured, in-depth interviews that were conducted with representatives of regional and local authorities, scientific units and business-related institutions. Recommendations for the regional policy of Lower Silesia have been formulated on this basis.
Źródło:
Miscellanea Geographica. Regional Studies on Development; 2017, 21, 2; 84-88
0867-6046
2084-6118
Pojawia się w:
Miscellanea Geographica. Regional Studies on Development
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Problemy wyznaczania optymalnej trajektorii obiektu na obszarze ograniczonym
Problems of the shortest path selection in restricted area
Autorzy:
Dramski, Mariusz
Powiązania:
https://bibliotekanauki.pl/articles/41205253.pdf
Data publikacji:
2014
Wydawca:
Uniwersytet Kazimierza Wielkiego w Bydgoszczy
Tematy:
trasa
optymalna trajektoria
obszar ograniczony
poszukiwanie drogi
route
path
optimal path
resticted area
path search
Opis:
Podstawowym celem systemów informatycznych w transporcie jest wspomaganie procesu przemieszczenia ładunku lub ludzi z punktu początkowego do punktu docelowego. Poza typowymi funkcjami związanymi z informatyczną obsługą przedsiębiorstwa, istnieje szereg metod wspomagających np. dobór optymalnej trasy dla środka transportu. Trasa optymalna to taka, której koszt (uwzględniając nie tylko odległość, ale także i inne czynniki) jest możliwie jak najmniejszy. W niniejszym artykule przedstawione są wyniki dotychczasowych prac prowadzonych w tym zakresie na Akademii Morskiej w Szczecinie.
The main task of the information systems in transport is supporting the process of the movement of cargo and people from the departure point to the destination. Besides the typical ERP functions, these systems have also some tools like searching for the optimal route etc. The optimal route is when it’s total cost (considering different factors) is minimal. In this paper the results of experiments carried out at The Maritime University of Szczecin are described.
Źródło:
Studia i Materiały Informatyki Stosowanej; 2014, 17; 16-21
1689-6300
Pojawia się w:
Studia i Materiały Informatyki Stosowanej
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On the path partition of graphs
Autorzy:
Kouider, Mekkia
Zamime, Mohamed
Powiązania:
https://bibliotekanauki.pl/articles/29519476.pdf
Data publikacji:
2023
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
path
partition
graphs
Opis:
Let $ G $ be a graph of order $ n $. The maximum and minimum degree of $ G $ are denoted by $ Δ $ and $ δ $, respectively. The path partition number $ μ(G) $ of a graph $ G $ is the minimum number of paths needed to partition the vertices of $ G $. Magnant, Wang and Yuan conjectured that $ μ(G) ≤ max { \frac{n}{δ+1} , \frac{(Δ-δ)n}{(Δ+δ)} } $. In this work, we give a positive answer to this conjecture, for $ Δ ≥ 2δ $.
Źródło:
Opuscula Mathematica; 2023, 43, 6; 829-839
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Characterizations of Graphs Having Large Proper Connection Numbers
Autorzy:
Lumduanhom, Chira
Laforge, Elliot
Zhang, Ping
Powiązania:
https://bibliotekanauki.pl/articles/31340917.pdf
Data publikacji:
2016-05-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
edge coloring
proper-path coloring
strong proper-path coloring
Opis:
Let G be an edge-colored connected graph. A path P is a proper path in G if no two adjacent edges of P are colored the same. If P is a proper u − v path of length d(u, v), then P is a proper u − v geodesic. An edge coloring c is a proper-path coloring of a connected graph G if every pair u, v of distinct vertices of G are connected by a proper u − v path in G, and c is a strong proper-path coloring if every two vertices u and v are connected by a proper u− v geodesic in G. The minimum number of colors required for a proper-path coloring or strong proper-path coloring of G is called the proper connection number pc(G) or strong proper connection number spc(G) of G, respectively. If G is a nontrivial connected graph of size m, then pc(G) ≤ spc(G) ≤ m and pc(G) = m or spc(G) = m if and only if G is the star of size m. In this paper, we determine all connected graphs G of size m for which pc(G) or spc(G) is m − 1,m − 2 or m − 3.
Źródło:
Discussiones Mathematicae Graph Theory; 2016, 36, 2; 439-453
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An exact geometry-based algorithm for path planning
Autorzy:
Jafarzadeh, H.
Fleming, C. H.
Powiązania:
https://bibliotekanauki.pl/articles/331494.pdf
Data publikacji:
2018
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
shortest possible path algorithm
path planning
collision free path
algorytm najkrótszej ścieżki
planowanie ścieżki
ścieżka bezkolizyjna
Opis:
A novel, exact algorithm is presented to solve the path planning problem that involves finding the shortest collision-free path from a start to a goal point in a two-dimensional environment containing convex and non-convex obstacles. The proposed algorithm, which is called the shortest possible path (SPP) algorithm, constructs a network of lines connecting the vertices of the obstacles and the locations of the start and goal points which is smaller than the network generated by the visibility graph. Then it finds the shortest path from start to goal point within this network. The SPP algorithm generates a safe, smooth and obstacle-free path that has a desired distance from each obstacle. This algorithm is designed for environments that are populated sparsely with convex and nonconvex polygonal obstacles. It has the capability of eliminating some of the polygons that do not play any role in constructing the optimal path. It is proven that the SPP algorithm can find the optimal path in O(nn’2) time, where n is the number of vertices of all polygons and n’ is the number of vertices that are considered in constructing the path network (n’ ≤ n). The performance of the algorithm is evaluated relative to three major classes of algorithms: heuristic, probabilistic, and classic. Different benchmark scenarios are used to evaluate the performance of the algorithm relative to the first two classes of algorithms: GAMOPP (genetic algorithm for multi-objective path planning), a representative heuristic algorithm, as well as RRT (rapidly-exploring random tree) and PRM (probabilistic road map), two well-known probabilistic algorithms. Time complexity is known for classic algorithms, so the presented algorithm is compared analytically.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2018, 28, 3; 493-504
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On the Isometric Path Partition Problem
Autorzy:
Manuel, Paul
Powiązania:
https://bibliotekanauki.pl/articles/32323579.pdf
Data publikacji:
2021-11-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
path cover problem
isometric path partition problem
isometric path cover problem
multi-dimensional grids
cylinder
torus
Opis:
The isometric path cover (partition) problem of a graph consists of finding a minimum set of isometric paths which cover (partition) the vertex set of the graph. The isometric path cover (partition) number of a graph is the cardinality of a minimum isometric path cover (partition). We prove that the isometric path partition problem and the isometric k-path partition problem for k 3 are NP-complete on general graphs. Fisher and Fitzpatrick in [The isometric number of a graph, J. Combin. Math. Combin. Comput. 38 (2001) 97–110] have shown that the isometric path cover number of the (r × r)-dimensional grid is ⌈2r/3 ⌉. We show that the isometric path cover (partition) number of the (r × s)-dimensional grid is s when r s(s − 1). We establish that the isometric path cover (partition) number of the (r × r)-dimensional torus is r when r is even and is either r or r + 1 when r is odd. Then, we demonstrate that the isometric path cover (partition) number of an r-dimensional Benes network is 2r. In addition, we provide partial solutions for the isometric path cover (partition) problems for cylinder and multi-dimensional grids. We apply two di erent techniques to achieve these results.
Źródło:
Discussiones Mathematicae Graph Theory; 2021, 41, 4; 1077-1089
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The directed path partition conjecture
Autorzy:
Frick, Marietjie
van Aardt, Susan
Dlamini, Gcina
Dunbar, Jean
Oellermann, Ortrud
Powiązania:
https://bibliotekanauki.pl/articles/744375.pdf
Data publikacji:
2005
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
longest path
Path Partition Conjecture
vertex partition
digraph
prismatic colouring
Opis:
The Directed Path Partition Conjecture is the following: If D is a digraph that contains no path with more than λ vertices then, for every pair (a,b) of positive integers with λ = a+b, there exists a vertex partition (A,B) of D such that no path in D⟨A⟩ has more than a vertices and no path in D⟨B⟩ has more than b vertices. We develop methods for finding the desired partitions for various classes of digraphs.
Źródło:
Discussiones Mathematicae Graph Theory; 2005, 25, 3; 331-343
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
WORM Colorings of Planar Graphs
Autorzy:
Czap, J.
Jendrol’, S.
Valiska, J.
Powiązania:
https://bibliotekanauki.pl/articles/31341972.pdf
Data publikacji:
2017-05-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
plane graph
monochromatic path
rainbow path
WORM coloring
facial coloring
Opis:
Given three planar graphs $F$, $H$, and $G$, an $(F,H)$-WORM coloring of $G$ is a vertex coloring such that no subgraph isomorphic to $F$ is rainbow and no subgraph isomorphic to $H$ is monochromatic. If $G$ has at least one $(F,H)$-WORM coloring, then $ W_{F,H}^- (G)$ denotes the minimum number of colors in an $(F,H)$-WORM coloring of $G$. We show that (a) $W_{F,H}^- (G) \le 2 $ if $ |V (F)| \ge 3$ and $H$ contains a cycle, (b) $W_{F,H}^- (G) \le 3 $ if $ |V (F)| \ge 4$ and $H$ is a forest with $ \Delta (H) \ge 3$, (c) $W_{F,H}^- (G) \le 4 $ if $ |V (F)| \ge 5$ and $H$ is a forest with $1 \le \Delta (H) \le 2 $. The cases when both $F$ and $H$ are nontrivial paths are more complicated; therefore we consider a relaxation of the original problem. Among others, we prove that any 3-connected plane graph (respectively outerplane graph) admits a 2-coloring such that no facial path on five (respectively four) vertices is monochromatic.
Źródło:
Discussiones Mathematicae Graph Theory; 2017, 37, 2; 353-368
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On the Path Sequence of a Graph
Autorzy:
Bakalarski, Sławomir
Zygadło, Jakub
Powiązania:
https://bibliotekanauki.pl/articles/1373669.pdf
Data publikacji:
2015
Wydawca:
Uniwersytet Jagielloński. Wydawnictwo Uniwersytetu Jagiellońskiego
Tematy:
$k$-path vertex cover
path sequence
list for small graphs
Opis:
A subset S of vertices of a graph $G = (V, E)$ is called a $k$-path vertex cover if every path on $k$ vertices in $G$ contains at least one vertex from $S$. Denote by $psi_k(G)$ the minimum cardinality of a $k$-path vertex cover in $G$ and form a sequence $\psi(G) = (\psi_1 (G), \psi_2 (G), . . . , \psi_{|V|} (G))$, called the path sequence of $G$. In this paper we prove necessary and sufficient conditions for two integers to appear on fixed positions in $\psi(G)$. A complete list of all possible path sequences (with multiplicities) for small connected graphs is also given.
Źródło:
Schedae Informaticae; 2015, 24; 239-251
0860-0295
2083-8476
Pojawia się w:
Schedae Informaticae
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The depression of a graph and k-kernels
Autorzy:
Schurch, Mark
Mynhardt, Christine
Powiązania:
https://bibliotekanauki.pl/articles/30148230.pdf
Data publikacji:
2014-05-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
edge ordering of a graph
increasing path
monotone path
depression
Opis:
An edge ordering of a graph G is an injection f : E(G) → R, the set of real numbers. A path in G for which the edge ordering f increases along its edge sequence is called an f-ascent ; an f-ascent is maximal if it is not contained in a longer f-ascent. The depression of G is the smallest integer k such that any edge ordering f has a maximal f-ascent of length at most k. A k-kernel of a graph G is a set of vertices U ⊆ V (G) such that for any edge ordering f of G there exists a maximal f-ascent of length at most k which neither starts nor ends in U. Identifying a k-kernel of a graph G enables one to construct an infinite family of graphs from G which have depression at most k. We discuss various results related to the concept of k-kernels, including an improved upper bound for the depression of trees.
Źródło:
Discussiones Mathematicae Graph Theory; 2014, 34, 2; 233-247
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A Survey of the Path Partition Conjecture
Autorzy:
Frick, Marietjie
Powiązania:
https://bibliotekanauki.pl/articles/30146727.pdf
Data publikacji:
2013-03-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
Path Partition Conjecture
Path Kernel Conjecture
generalized colourings
additive hereditary properties
Opis:
The Path Partition Conjecture (PPC) states that if G is any graph and (λ1, λ2) any pair of positive integers such that G has no path with more than λ1 + λ2 vertices, then there exists a partition (V1, V2) of the vertex set of G such that Vi has no path with more than λi vertices, i = 1, 2. We present a brief history of the PPC, discuss its relation to other conjectures and survey results on the PPC that have appeared in the literature since its first formulation in 1981.
Źródło:
Discussiones Mathematicae Graph Theory; 2013, 33, 1; 117-131
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Etapy życia zawodowego a podstawa planowania ścieżki kariery zawodowej
PHASES OF VOCATIONAL LIFE AND FOUNDATIONS OF CAREER PATH PLANNING
Autorzy:
Łyszkowska, Edyta
Powiązania:
https://bibliotekanauki.pl/articles/417489.pdf
Data publikacji:
2010
Wydawca:
Akademickie Towarzystwo Andragogiczne
Tematy:
CAREER PATH
VOCATIONAL LIFE
Opis:
The aim of this paper is to discuss different theories of vocational consuelling concerning the career path planning. The autor characterizes conceptions of vocational development: tracits and factory, psychodynamic theories, developmental theories, cognitive-social theories. Then she diskusses the process of career path planning in four phases, paying special attention to changes in contemporary vocational life that make the process coutinning and multidimensional.
Źródło:
Rocznik Andragogiczny; 2010, R. 2010
1429-186X
2391-7571
Pojawia się w:
Rocznik Andragogiczny
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Lightweight paths in graphs
Autorzy:
Harant, Jochen
Jendrol, Stanislav
Powiązania:
https://bibliotekanauki.pl/articles/255411.pdf
Data publikacji:
2019
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
weighted graph
lightweight path
Opis:
Let k be a positive integer, G be a graph on V(G) containing a path on k vertices, and w be a weight function assigning each vertex v ∈ V(G) a real weight w(y). Upper bounds on the weight [formula] of P are presented, where P is chosen among all paths of G on k vertices with smallest weight.
Źródło:
Opuscula Mathematica; 2019, 39, 6; 829-837
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 544

Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies