On the parameterized complexity of separating certain sources from the target (Q2330108): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: Wikidata QID (P12): Q127575551, #quickstatements; #temporary_batch_1722284575798
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2019.06.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2953744542 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing small partial coverings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicut is FPT / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved parameterized algorithm for the minimum node multiway cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Multiterminal Cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5472076 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2843923 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Parameterized Complexity of Cutting a Few Vertices from a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal Flow Through a Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiway cuts in node weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the <i>k</i>-multicut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial multicuts in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized graph separation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter tractability of multicut parameterized by the size of the cutset / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4231923 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed multicut is <i>W</i>[1]-hard, even for four terminal pairs / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127575551 / rank
 
Normal rank

Latest revision as of 21:30, 29 July 2024

scientific article
Language Label Description Also known as
English
On the parameterized complexity of separating certain sources from the target
scientific article

    Statements

    Identifiers