1. Approximate graph products
- Author
-
Hellmuth, Marc, Imrich, Wilfried, Klöckl, Werner, and Stadler, Peter F.
- Subjects
- *
ALGORITHMS , *GRAPH theory , *APPROXIMATION theory , *MATHEMATICAL analysis , *COMBINATORICS - 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]
- Published
- 2009
- Full Text
- View/download PDF