Back to Search
Start Over
Approximate graph products
- Source :
-
European Journal of Combinatorics . Jul2009, Vol. 30 Issue 5, p1119-1133. 15p. - Publication Year :
- 2009
-
Abstract
- Abstract: The problem of recognizing approximate graph products arises in theoretical biology. This paper presents an algorithm that recognizes a large class of approximate graph products. The main part of this contribution is concerned with a new, local prime factorization algorithm that factorizes all strong products on an extensive class of graphs that contains, in particular, all products of triangle-free graphs on at least three vertices. The local approach is linear for graph with fixed maximal degree. [Copyright &y& Elsevier]
Details
- Language :
- English
- ISSN :
- 01956698
- Volume :
- 30
- Issue :
- 5
- Database :
- Academic Search Index
- Journal :
- European Journal of Combinatorics
- Publication Type :
- Academic Journal
- Accession number :
- 37352211
- Full Text :
- https://doi.org/10.1016/j.ejc.2008.09.006