Finding a Small Number of Colourful Components (Q5088911): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
label / enlabel / en
 
Finding a Small Number of Colourful Components
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic and hardness results for the colorful components problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning into Colorful Components by Minimum Edge Deletions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal strip recovery problem with gaps: hardness and approximation algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a complexity dichotomy for colourful components problems on \(k\)-caterpillars and small-degree planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Multiterminal Cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity and approximation issues for the colorful components problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Some Graph Partitioning Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterized complexity of colorful components and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XIII: The disjoint paths problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner trees, partial 2–trees, and minimum IFI networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: OMG! Orthologs in Multiple Genomes – Competing Graph-Theoretical Formulations / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2955146193 / rank
 
Normal rank
Property / title
 
Finding a Small Number of Colourful Components (English)
Property / title: Finding a Small Number of Colourful Components (English) / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:30, 30 July 2024

scientific article; zbMATH DE number 7559188
Language Label Description Also known as
English
Finding a Small Number of Colourful Components
scientific article; zbMATH DE number 7559188

    Statements

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    18 July 2022
    0 references
    colourful component
    0 references
    colourful partition
    0 references
    tree
    0 references
    treewidth
    0 references
    vertex cover
    0 references
    Finding a Small Number of Colourful Components (English)
    0 references

    Identifiers