Fixed-parameter tractability and data reduction for multicut in trees (Q3367053): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(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.1002/net.20081 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W4243521820 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Algorithms and Data Structures / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Mathematical Foundations of Computer Science 2004 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On efficient fixed-parameter algorithms for weighted vertex cover / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4414647 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 10:35, 24 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Fixed-parameter tractability and data reduction for multicut in trees |
scientific article |
Statements
Fixed-parameter tractability and data reduction for multicut in trees (English)
0 references
23 January 2006
0 references
NP-hard problems
0 references
Multicut in Trees
0 references
exact algorithms
0 references
fixed-parameter tractability
0 references
data reduction rules
0 references
problem kernel
0 references