Finding<i>H</i>-partitions efficiently (Q4680731): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Celina M. Herrera de Figueiredo / rank
Normal rank
 
Property / author
 
Property / author: Celina M. Herrera de Figueiredo / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2152728086 / 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: Q4521527 / rank
 
Normal rank
Property / cites work
 
Property / cites work: List homomorphisms to reflexive graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of graph partition problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: List Partitions / rank
 
Normal rank

Latest revision as of 12:10, 10 June 2024

scientific article; zbMATH DE number 2174150
Language Label Description Also known as
English
Finding<i>H</i>-partitions efficiently
scientific article; zbMATH DE number 2174150

    Statements

    Finding<i>H</i>-partitions efficiently (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 June 2005
    0 references
    0 references
    0 references
    0 references
    0 references
    list partition
    0 references
    efficient algorithm
    0 references
    0 references