COMPUTER SCIENCE COLLOQUIUM
Approximate Graph Products
Marc Hellmuth
Department of Computer Science, Bioinformatics Group
University of Leipzig, Germany
Tuesday, 13 January, 2009 at 14:15
Auditorium U49B
ABSTRACT
Graphs arising in practical application
often arise as perturbed product structures.
This talk presents an algorithm that recognizes
a large class of approximate graph products.
The main part of this talk is concerned
with a new, local prime factorization algorithm
that factorizes all strong products on an extensive
class of graphs, the so called NICE graphs.
We will also discuss the problems that arise by
the consideration of nonNICE graphs.
Host: Daniel Merkle
SDU HOME |
IMADA HOME |
Previous Page
Daniel Merkle
