Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik

A prime factor theorem for a generalized direct product

100%

Imrich W., Stadler P.

Discussiones Mathematicae Graph Theory

2006

tom 26

nr 1

135-140

We introduce the concept of neighborhood systems as a generalization of directed, reflexive graphs and show that the prime factorization of neighborhood systems with respect to the the direct product is unique under the condition that they satisfy an appropriate notion of thinness.

Circuit bases of strongly connected digraphs

81%

Gleiss P., Leydold J., Stadler P.

Discussiones Mathematicae Graph Theory

2003

tom 23

nr 2

241-260

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.

Ograniczanie wyników

2 Discussiones Mathematicae Graph Theory

2 Stadler P.

1 Gleiss P.

1 Imrich W.

1 Leydold J.

1 2006

1 2003

Wyniki wyszukiwania

A prime factor theorem for a generalized direct product

Circuit bases of strongly connected digraphs