FPT Algorithms for Path-Transversals and Cycle-Transversals Problems in Graphs (Q3503584): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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.1007/978-3-540-79723-4_13 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1586475286 / 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: Packing non-zero \(A\)-paths in group-labelled graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiway cuts in directed and node weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating unique games / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of unique 2-prover 1-round games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized graph separation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding odd cycle transversals. / rank
 
Normal rank

Latest revision as of 10:23, 28 June 2024

scientific article
Language Label Description Also known as
English
FPT Algorithms for Path-Transversals and Cycle-Transversals Problems in Graphs
scientific article

    Statements

    Identifiers