3 Result(s)
within
Manuel Sorge
Algorithms
Computer Systems Organization and Communication Networks
-
Article
Open AccessThe Complexity of Routing Problems in Forbidden-Transition Graphs and Edge-Colored Graphs
The notion of forbidden-transition graphs allows for a robust generalization of walks in graphs. In a forbidden-transition graph, every pair of edges incident to a common vertex is permitted or forbidden; a walk ...
-
Article
The Minimum Feasible Tileset Problem
We introduce and study the Minimum Feasible Tileset problem: given a set of symbols and subsets of these symbols (scenarios), find a smallest possible number of pairs of symbols (tiles) such that each scenario ca...
-
Article
On Kernelization and Approximation for the Vector Connectivity Problem
In the Vector Connectivity problem we are given an undirected graph \(G=(V,E)\) ...
