Zobrazeno 1 - 10
of 52
pro vyhledávání: '"Wahlstrom, Magnus"'
We introduce and study two natural generalizations of the Connected VertexCover (VC) problem: the $p$-Edge-Connected and $p$-Vertex-Connected VC problem (where $p \geq 2$ is a fixed integer). Like Connected VC, both new VC problems are FPT, but do no
Externí odkaz:
http://arxiv.org/abs/2009.08158
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
A walk $W$ in edge-colored graphs is called properly colored (PC) if every pair of consecutive edges in $W$ is of different color. We introduce and study five types of PC acyclicity in edge-colored graphs such that graphs of PC acyclicity of type $i$
Externí odkaz:
http://arxiv.org/abs/1601.01824
Autor:
Gutin, Gregory, Wahlstrom, Magnus
The Workflow Satisfiability Problem (WSP) asks whether there exists an assignment of authorized users to the steps in a workflow specification, subject to certain constraints on the assignment. The problem is NP-hard even when restricted to just not
Externí odkaz:
http://arxiv.org/abs/1508.06829
A workflow specification defines sets of steps and users. An authorization policy determines for each user a subset of steps the user is allowed to perform. Other security requirements, such as separation-of-duty, impose constraints on which subsets
Externí odkaz:
http://arxiv.org/abs/1504.03561
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
In the Mixed Chinese Postman Problem (MCPP), given a weighted mixed graph $G$ ($G$ may have both edges and arcs), our aim is to find a minimum weight closed walk traversing each edge and arc at least once. The MCPP parameterized by the number of edge
Externí odkaz:
http://arxiv.org/abs/1410.5191
In the Directed $k$-Chinese Postman Problem ($k$-DCPP), we are given a connected weighted digraph $G$ and asked to find $k$ non-empty closed directed walks covering all arcs of $G$ such that the total weight of the walks is minimum. Gutin, Muciaccia
Externí odkaz:
http://arxiv.org/abs/1402.2137
The Directed Rural Postman Problem (DRPP) can be formulated as follows: given a strongly connected directed multigraph $D=(V,A)$ with nonnegative integral weights on the arcs, a subset $R$ of $A$ and a nonnegative integer $\ell$, decide whether $D$ h
Externí odkaz:
http://arxiv.org/abs/1308.2599
Autor:
Cygan, Marek, Dell, Holger, Lokshtanov, Daniel, Marx, Daniel, Nederlof, Jesper, Okamoto, Yoshio, Paturi, Ramamohan, Saurabh, Saket, Wahlstrom, Magnus
Publikováno v:
ACM Trans. Algorithms 12(3): 41:1-41:24 (2016)
The field of exact exponential time algorithms for NP-hard problems has thrived over the last decade. While exhaustive search remains asymptotically the fastest known algorithm for some basic problems, difficult and non-trivial exponential time algor
Externí odkaz:
http://arxiv.org/abs/1112.2275