Informacja

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

Wyszukujesz frazę "directed graph" wg kryterium: Temat


Wyświetlanie 1-4 z 4
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ł:
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ł:
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-4 z 4

    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