Temat: directed graphs - Katalog OPAC zbiorów

Skocz do pozycji: 1.

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ł

Skocz do pozycji: 2.

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ł

Skocz do pozycji: 3.

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ł

Skocz do pozycji: 4.

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ł

Informacja