Fixed-parameter algorithms for DAG Partitioning

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F17%3A00311743" target="_blank" >RIV/68407700:21240/17:00311743 - isvavai.cz</a>
Result on the web
<a href="http://www.sciencedirect.com/science/article/pii/S0166218X16306205?via%3Dihub" target="_blank" >http://www.sciencedirect.com/science/article/pii/S0166218X16306205?via%3Dihub</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.dam.2016.12.002" target="_blank" >10.1016/j.dam.2016.12.002</a>

Result language
angličtina
Original language name
Fixed-parameter algorithms for DAG Partitioning
Original language description
Finding the origin of short phrases propagating through the web has been formalized by Leskovec et al. (2009) as DAG PARTITIONING: given an arc-weighted directed acyclic graph on n vertices and m arcs, delete arcs with total weight at most k such that each resulting weakly-connected component contains exactly one sink-a vertex without outgoing arcs. DAG PARTITIONING iS NP-hard.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project
<a href="/en/project/GP14-13017P" target="_blank" >GP14-13017P: Parameterized Algorithms for Fundamental Network Problems Related to Connectivity</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2017
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)