CS talk today: Slashed graph representation in design & control problems

IMG_2462Title: Distributed graph models and transformations – slashed graph representation in design and control problems

[Presentation Slides]

Speaker: Adam Sędziwy, PhD, AGH University of Science and Technology, Kraków, Poland

Time: Thursday, June 9, 2016, at 11am

Place: Sierra Hall 1422

Abstract: Graph based structures play the important role in all domains of science: structure of physical objects, logical structure of abstract entities, functional and logical dependencies among them, data and process flows, dynamics of systems and many, many other phenomena can be  successfully described by graphs and hypergraphs. Practical application of graphs, however, meets constraints related to the complexity. They can be reduced to such common known problems as subgraph isomorphism problem, existence of k-clique, Hamiltonian path problem and others.

In this talk I will present the summary of the research on methods being a workaround to graph-related complexity issues. Obtained results enable practical application of graph-based models to problems inducing the graphs having tens of thousands of vertices. The application of presented methods to real-life cases will illustrate the presentation.

Bio: Adam Sędziwy (MSc, PhD, DSc (in completion) in computer science, MSc in theoretical physics) is an assistant professor in Dept. of Applied Computer Science, AGH University of Science and Technology, Kraków, Poland. His area of interest includes distributed graph transformations relied on multi-agent systems, and their applications. He also focuses on advanced methods of outdoor lighting design and control yielding highly energy-efficient SSL-based roadway lighting installations. He cooperates with lighting solutions vendors such as GE Lighting, Schreder, Philips. He is author and co-author of nearly 60 research publications. URL: http://researchgate.net/profile/Adam_Sedziwy

Leave a Reply

Your email address will not be published.