2K2-Partition Problem (Q3439337): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Luérbio Faria / rank
Normal rank
 
Property / author
 
Property / author: Luérbio Faria / rank
 
Normal rank
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.endm.2005.06.031 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1969073015 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Star-cutsets and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding<i>H</i>-partitions efficiently / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4521527 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of graph partition problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:08, 25 June 2024

scientific article
Language Label Description Also known as
English
2K2-Partition Problem
scientific article

    Statements

    2K2-Partition Problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    29 May 2007
    0 references
    partition problems
    0 references
    computational complexity
    0 references
    np-completeness
    0 references

    Identifiers