On Dynamic Parameterized $k$-Path

Czerwiński Wojciech
Czerwiński Wojciech
Nadara Wojciech
Nadara Wojciech
Wróblewski Bartłomiej
Wróblewski Bartłomiej
Cited by: 0|Views71

Abstract:

We present a data structure that for a dynamic graph $G$, which is updated by edge insertions and removals, maintains the answer to the query whether $G$ contains a simple path on $k$ vertices with amortized update time $2^{O(k^2)}$, assuming access to a dictionary on the edges of $G$. Underlying this result lies a data structure that m...More

Code:

Data:

Get fulltext within 24h
Bibtex
Your rating :
0

 

Tags
Comments