Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs (Q3297773): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
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.1007/978-3-030-38919-2_21 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3000485278 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2965980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The parameterized complexity of some minimum label problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum cuts in edge-colored graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4663414 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-colored graphs with applications to homogeneous faults / rank
 
Normal rank
Property / cites work
 
Property / cites work: The label cut problem with respect to path length and label frequency / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:58, 23 July 2024

scientific article
Language Label Description Also known as
English
Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references