In dieser Arbeit entwickeln wir schnellere exakte Algorithmen (schneller bezüglich der Worst-Case-Laufzeit) für Spezialfälle von Graphproblemen. Diese Algorithmen beruhen größtenteils auf dynamischem Programmieren und auf 2- SAT-Programmierung . Dynamisches Programmieren beschre…
"8" Result
Sort By:
In this work, connectivity graphs have been studied as models of local interactions in multi-agent robotic systems. A systematic study of the space of connectivity graphs has been done from a geometric and topological point of view. Some results on the realization of connectivit…
Stokastik engellerin olduğu yol planlaması, çok populer bir araştırma alanı olarak bilinir. Zorlayıcı bir stokastik optimizasyon problemi olan Kanadalı Gezgin Probleminde (CTP), bloke edilmiş yollar içeren bir haritada engele bitişik bir köşeye ulaşıldığında önceden tanımlanmış …
We study contact representations of graphs in the plane and in 3D space, where vertices are represented by polygons or polyhedra and each edge is represented by a common boundary between two polygons or polyhedra. In the weighted version of the problem, we find contact represent…
In this thesis we discuss two topics: domination parameters and inducibility. In the first chapter, we introduce basic concepts, definitions, and a brief history for both types of problems. We will first inspect domination parameters in graphs, particularly independent dominatio…