Zobrazeno 1 - 10
of 272
pro vyhledávání: '"Menger's theorem"'
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Applicable Analysis and Discrete Mathematics, 2018 Oct 01. 12(2), 297-317.
Externí odkaz:
https://www.jstor.org/stable/26511378
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Cristina Dalfo, Miquel Àngel Fiol
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 6, Iss 2, Pp 282-305 (2018)
A graph is a mathematical object modeling the existence of a certain relation between pairs of elements of a given set. Many of the first results concerning graphs made reference to relationships between groups of people. In this article, we comment
Externí odkaz:
https://doaj.org/article/6dce64dea07e46dea6fc0c7f3ed2b443
Autor:
Wagner, Uli, Welzl, Emo
Publikováno v:
Discrete & Computational Geometry, 68 (4)
Given a finite point set P in general position in the plane, a full triangulation of P is a maximal straight-line embedded plane graph on P. A partial triangulation of P is a full triangulation of some subset P' of P containing all extreme points in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0299ffa3bc2c254dd3e8037c48f4bd5f
https://doi.org/10.1007/s00454-022-00436-2
https://doi.org/10.1007/s00454-022-00436-2
Publikováno v:
Symmetry, Vol 13, Iss 6, p 1050 (2021)
Let P be a set of n≥3 points in general position in the plane. The edge disjointness graph D(P) of P is the graph whose vertices are the n2 closed straight line segments with endpoints in P, two of which are adjacent in D(P) if and only if they are
Externí odkaz:
https://doaj.org/article/81e886820d994e56a2bf632aedd683eb
Autor:
Ibiapina, Allen, Silva, Ana
In the study of temporal graphs, only paths respecting the flow of time are relevant. In this context, many concepts of walks disjointness have been proposed over the years, and the validity of Menger’s Theorem, as well as the complexity of related
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::04f85e4ed484d907e7e4b7a31cb0845c
http://arxiv.org/abs/2302.06653
http://arxiv.org/abs/2302.06653
Publikováno v:
Journal of Parallel and Distributed Computing. 158:67-79
One of most central issues in various interconnection networks of parallel and distributed systems is to find edge-disjoint paths concerned with an information transmission through links. It is universally acknowledged that an interconnection network
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3cf2b1e2df613663a10d13fd9f16e73d
https://doi.org/10.1016/j.jpdc.2021.07.020
https://doi.org/10.1016/j.jpdc.2021.07.020
Publikováno v:
Journal of Intelligent & Fuzzy Systems. 41:1553-1574
The main objective of this research article is to classify different types of m-polar fuzzy edges in an m-polar fuzzy graph by using the strength of connectedness between pairs of vertices. The identification of types of m-polar fuzzy edges, includin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f91070616b900546cfe6d2da5281a267
https://doi.org/10.3233/jifs-210411
https://doi.org/10.3233/jifs-210411