7 citations · 14 across the 15 of their papers we have counts for
Showing 2013 · cs.DMShow all
2 papers · 2 filters
cs.DM2013
Fast Recognition of Partial Star Products and Quasi Cartesian Products
Marc Hellmuth, Wilfried Imrich, Tomas Kupka
This paper is concerned with the fast computation of a relation on the edge set of connected graphs that plays a decisive role in the recognition of approximate Cartesian prod…
cs.DM2013★ 7 cited
Partial Star Products: A Local Covering Approach for the Recognition of Approximate Cartesian Product Graphs
Marc Hellmuth, Wilfried Imrich, Tomas Kupka
This paper is concerned with the recognition of approximate graph products with respect to the Cartesian product. Most graphs are prime, although they can have a rich product-like…