Back to Search
Start Over
FACTORING DIRECTED GRAPHS WITH RESPECT TO THE CARDINAL PRODUCT IN POLYNOMIAL TIME II.
- Source :
-
Discussiones Mathematicae: Graph Theory . 2010, Vol. 30 Issue 3, p461-474. 14p. 2 Diagrams, 1 Graph. - Publication Year :
- 2010
-
Abstract
- 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. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 12343099
- Volume :
- 30
- Issue :
- 3
- Database :
- Academic Search Index
- Journal :
- Discussiones Mathematicae: Graph Theory
- Publication Type :
- Academic Journal
- Accession number :
- 53384061
- Full Text :
- https://doi.org/10.7151/dmgt.1507