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ę "directed graphs" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-8 z 8
    Tytuł:
    Factoring directed graphs with respect to the cardinal product in polynomial time
    Autorzy:
    Imrich, Wilfried
    Klöckl, Werner
    Powiązania:
    https://bibliotekanauki.pl/articles/743472.pdf
    Data publikacji:
    2007
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    directed graphs
    cardinal product
    graph algorithms
    Opis:
    By a result of McKenzie [4] finite directed graphs that satisfy certain connectivity and thinness conditions have the unique prime factorization property with respect to the cardinal product. We show that this property still holds under weaker connectivity and stronger thinness conditions. Furthermore, for such graphs the factorization can be determined in polynomial time.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2007, 27, 3; 593-601
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Factoring directed graphs with respect to the cardinal product in polynomial time II
    Autorzy:
    Imrich, Wilfried
    Klöckl, Werner
    Powiązania:
    https://bibliotekanauki.pl/articles/744038.pdf
    Data publikacji:
    2010
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    directed graphs
    cardinal product
    graph algorithms
    Opis:
    By a result of McKenzie [7] all finite directed graphs that satisfy certain connectivity conditions have unique prime factorizations with respect to the cardinal product. McKenzie does not provide an algorithm, and even up to now no polynomial algorithm that factors all graphs satisfying McKenzie's conditions is known. Only partial results [1,3,5] have been published, all of which depend on certain thinness conditions of the graphs to be factored.
    In this paper we weaken the thinness conditions and thus significantly extend the class of graphs for which the prime factorization can be found in polynomial time.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2010, 30, 3; 461-474
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    On L(2, 1)-Labelings of Oriented Graphs
    Autorzy:
    Colucci, Lucas
    Győri, Ervin
    Powiązania:
    https://bibliotekanauki.pl/articles/32361754.pdf
    Data publikacji:
    2022-02-01
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    L (2,1)-labeling
    directed graphs
    Opis:
    We extend a result of Griggs and Yeh about the maximum possible value of the L(2, 1)-labeling number of a graph in terms of its maximum degree to oriented graphs. We consider the problem both in the usual definition of the oriented L(2, 1)-labeling number and in some variants we introduce.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2022, 42, 1; 39-46
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Cycles in Bayesian Networks
    Autorzy:
    Shayakhmetova, Assem
    Litvinenko, Natalya
    Mamyrbayev, Orken
    Wójcik, Waldemar
    Zhamangarin, Dusmat
    Powiązania:
    https://bibliotekanauki.pl/articles/1844619.pdf
    Data publikacji:
    2021
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    Bayesian networks
    directed graphs
    directed cycles
    propagation
    Bayesian evidence
    Opis:
    The article is devoted to some critical problems of using Bayesian networks for solving practical problems, in which graph models contain directed cycles. The strict requirement of the acyclicity of the directed graph representing the Bayesian network does not allow to efficiently solve most of the problems that contain directed cycles. The modern theory of Bayesian networks prohibits the use of directed cycles. The requirement of acyclicity of the graph can significantly simplify the general theory of Bayesian networks, significantly simplify the development of algorithms and their implementation in program code for calculations in Bayesian networks.
    Źródło:
    International Journal of Electronics and Telecommunications; 2021, 67, 2; 181-186
    2300-1933
    Pojawia się w:
    International Journal of Electronics and Telecommunications
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Circuit bases of strongly connected digraphs
    Autorzy:
    Gleiss, Petra
    Leydold, Josef
    Stadler, Peter
    Powiązania:
    https://bibliotekanauki.pl/articles/743155.pdf
    Data publikacji:
    2003
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    directed graphs
    cycle space
    relevant circuits
    minimum length basis
    Opis:
    The cycle space of a strongly connected graph has a basis consisting of directed circuits. The concept of relevant circuits is introduced as a generalization of the relevant cycles in undirected graphs. A polynomial time algorithm for the computation of a minimum weight directed circuit basis is outlined.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2003, 23, 2; 241-260
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Non-factorizable c-valued functions induced by finite connected graphs
    Autorzy:
    Cho, I.
    Powiązania:
    https://bibliotekanauki.pl/articles/255928.pdf
    Data publikacji:
    2017
    Wydawca:
    Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
    Tematy:
    directed graphs
    graph groupoids
    Redei zeta functions
    graph zeta functions
    non-factorizable graphs
    gluing on graphs
    Opis:
    In this paper, we study factorizability of C-valued formal series at fixed vertices, called the graph zeta functions, induced by the reduced length on the graph groupoids of given finite connected directed graphs. The construction of such functions is motivated by that of Redei zeta functions. In particular, we are interested in (i) “non-factorizability” of such functions, and (ii) certain factorizable functions induced by non-factorizable functions. By constructing factorizable functions from our non-factorizable functions, we study relations between graph zeta functions and well-known number-theoretic objects, the Riemann zeta function and the Euler totient function.
    Źródło:
    Opuscula Mathematica; 2017, 37, 2; 225-263
    1232-9274
    2300-6919
    Pojawia się w:
    Opuscula Mathematica
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    An algorithm for the solution of the traveling salesman problem via disjunctive graphs
    Autorzy:
    Grabowski, Józef
    Powiązania:
    https://bibliotekanauki.pl/articles/748529.pdf
    Data publikacji:
    1978
    Wydawca:
    Polskie Towarzystwo Matematyczne
    Tematy:
    Directed graphs (digraphs), tournaments
    Scheduling theory, deterministic
    Special problems of linear programming(transportation, multi-index, etc.)
    Opis:
    .
    From the introduction: "The traveling salesman problem is a problem of combinatorial type. Although problems of this type sometimes have a relatively simple formulation, there are many difficulties associated with their solution even when the most up-to-date computers are used. In the 1970s many papers have been devoted to this problem. The purpose of the vast majority of them has been to find more effective solution algorithms. "In this paper we give the solution of the traveling salesman problem via disjunctive graphs. Up to now the elements of disjunctive graphs have been used to solve problems connected with the determination of an optimal task completion sequence.''
    Źródło:
    Mathematica Applicanda; 1978, 6, 13
    1730-2668
    2299-4009
    Pojawia się w:
    Mathematica Applicanda
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Free probability induced by electric resistance networks on energy Hilbert spaces
    Autorzy:
    Cho, I.
    Jorgensen, P. E. T.
    Powiązania:
    https://bibliotekanauki.pl/articles/254830.pdf
    Data publikacji:
    2011
    Wydawca:
    Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
    Tematy:
    directed graphs
    graph groupoids
    electric resistance networks
    ERN-groupoids
    energy Hilbert spaces
    ERN-algebras
    free moments
    free cumulants
    Opis:
    We show that a class of countable weighted graphs arising in the study of electric resistance networks (ERNs) are naturally associated with groupoids. Starting with a fixed ERN, it is known that there is a canonical energy form and a derived energy Hilbert space Hε. From Hε, one then studies resistance metrics and boundaries of the ERNs. But in earlier research, there does not appear to be a natural algebra of bounded operators acting on Hε. With the use of our ERN-groupoid, we show that Hε may be derived as a representation Hilbert space of a universal representation of a groupoid algebra [formula], and we display other representations. Among our applications, we identify a free structure of [formula] in terms of the energy form.
    Źródło:
    Opuscula Mathematica; 2011, 31, 4; 549-598
    1232-9274
    2300-6919
    Pojawia się w:
    Opuscula Mathematica
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-8 z 8

      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