Výsledky vyhledávání - "Parameterized complexity and exact algorithms"

Multicut Problems in Embedded Graphs: The Dependency of Complexity on the Demand Pattern Autor Focke, Jacob, Hörsch, Florian, Li, Shaohua, Marx, Dániel

“…The Multicut problem asks for a minimum cut separating certain pairs of vertices: formally, given a graph G and a demand graph H on a set $$T\subseteq V(G)$$ T…”
Získat plný text

AWDIT: An Optimal Weak Database Isolation Tester Autor Møldrup, Lasse, Pavlogiannis, Andreas

“…Database isolation is a formal contract concerning the level of data consistency that a database provides to its clients. In order to achieve low latency, high…”
Získat plný text

Exploiting the Sparseness of Control-Flow and Call Graphs for Efficient and On-Demand Algebraic Program Analysis Autor Conrado, Giovanna Kobus, Goharshady, Amir Kafshdar, Kochekov, Kerim, Tsai, Yun Chen, Zaher, Ahmed Khaled

“…Algebraic Program Analysis (APA) is a ubiquitous framework that has been employed as a unifying model for various problems in data-flow analysis, termination…”
Získat plný text

Efficient parameterized algorithms for data packing Autor Chatterjee, Krishnendu, Goharshady, Amir Kafshdar, Okati, Nastaran, Pavlogiannis, Andreas

“…There is a huge gap between the speeds of modern caches and main memories, and therefore cache misses account for a considerable loss of efficiency in…”
Získat plný text