Name
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. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1016/j.ejc.2008.09.006 | Eur. J. Comb. |
Keywords | Field | DocType |
local approach,large class,approximate graph product,theoretical biology,extensive class,fixed maximal degree,triangle-free graph,strong product,local prime factorization algorithm,main part | Discrete mathematics,Combinatorics,Outerplanar graph,Line graph,Graph property,Graph homomorphism,Null graph,Symmetric graph,Universal graph,Mathematics,Complement graph | Journal |
Volume | Issue | ISSN |
30 | 5 | 0195-6698 |
Citations | PageRank | References |
7 | 0.64 | 5 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| marc hellmuth | 1 | 148 | 22.80 |
| Wilfried Imrich | 2 | 444 | 53.81 |
| Werner Klöckl | 3 | 14 | 2.20 |
| Peter F. Stadler | 4 | 1839 | 152.96 |