Efficiently computing alternative paths in game maps
Alternative pathfinding requires finding a set of k alternative paths (including the shortest
path) between a given source s and a target t. Intuitively, these paths should be significantly …
path) between a given source s and a target t. Intuitively, these paths should be significantly …
Faster FPT algorithm for 5-path vertex cover
R Červený, O Suchý - arXiv preprint arXiv:1906.09213, 2019 - arxiv.org
The problem of $ d $-Path Vertex Cover, $ d $-PVC lies in determining a subset $ F $ of
vertices of a given graph $ G=(V, E) $ such that $ G\setminus F $ does not contain a path on …
vertices of a given graph $ G=(V, E) $ such that $ G\setminus F $ does not contain a path on …
Generating faster algorithms for d-path vertex cover
R Červený, O Suchý - arXiv preprint arXiv:2111.05896, 2021 - arxiv.org
Many algorithms which exactly solve hard problems require branching on more or less
complex structures in order to do their job. Those who design such algorithms often find …
complex structures in order to do their job. Those who design such algorithms often find …
On kernels for d-path vertex cover
R Červený, P Choudhary, O Suchý - Journal of Computer and System …, 2024 - Elsevier
In this paper we study the kernelization of the d-Path Vertex Cover (d-PVC) problem. Given a
graph G, the problem requires finding whether there exists a set of at most k vertices whose …
graph G, the problem requires finding whether there exists a set of at most k vertices whose …
Preference-based trajectory clustering-an application of geometric hitting sets
In a road network with multicriteria edge costs we consider the problem of computing a
minimum number of driving preferences such that a given set of paths/trajectories is optimal …
minimum number of driving preferences such that a given set of paths/trajectories is optimal …
On the group coverage centrality problem: Parameterized complexity and heuristics
C Komusiewicz, J Schramek, F Sommer - SIAM Conference on Applied and …, 2023 - SIAM
We study the problem of computing a group of k vertices that covers a maximum number of
shortest paths in a graph in the context of network centrality. In Group Coverage Centrality …
shortest paths in a graph in the context of network centrality. In Group Coverage Centrality …
Generating Faster Algorithms for d-Path Vertex Cover
R Červený, O Suchý - … Workshop on Graph-Theoretic Concepts in …, 2023 - Springer
Many algorithms which exactly solve hard problems require branching on more or less
complex structures in order to do their job. Those who design such algorithms often find …
complex structures in order to do their job. Those who design such algorithms often find …
Concatenated k-Path Covers
Given a directed graph G (V, E), ak-(Shortest) Path Cover is a subset C of the nodes V such
that every simple (or shortest) path in G consisting of k nodes contains at least one node …
that every simple (or shortest) path in G consisting of k nodes contains at least one node …
Parametrizované algoritmy pro podchycování podgrafů
Č Radovan - 2024 - dspace.cvut.cz
V této dizertační práci se zabýváme rodinou problémů pokrývání podgrafů. Soustředíme se
zejména na problém F-Subgraph Vertex Deletion (F-SVD), kde F je konečná množina …
zejména na problém F-Subgraph Vertex Deletion (F-SVD), kde F je konečná množina …
Heuristic coarsening for generating multiscale transport networks
P Krishnakumari, O Cats… - IEEE Transactions on …, 2019 - ieeexplore.ieee.org
Graphs at different scales are essential tools for many transportation applications.
Notwithstanding their relevance, these graphs are created and maintained manually for …
Notwithstanding their relevance, these graphs are created and maintained manually for …