Algorithms for partition of some class of graphs under compaction and vertex-compaction (Q378212): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3619797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: List homomorphisms to reflexive graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: List homomorphisms and circular arc 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
Property / cites work
 
Property / cites work: Polynomial graph-colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5572939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of H-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality and Polynomial Testing of Tree Homomorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consistency in networks of relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Networks of constraints: Fundamental properties and applications to picture processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252439 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414515 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of Compaction to Reflexive Cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of compaction to irreflexive cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compaction, Retraction, and Constraint Satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Partition of Some Class of Graphs under Compaction / rank
 
Normal rank

Latest revision as of 00:39, 7 July 2024

scientific article
Language Label Description Also known as
English
Algorithms for partition of some class of graphs under compaction and vertex-compaction
scientific article

    Statements

    Algorithms for partition of some class of graphs under compaction and vertex-compaction (English)
    0 references
    0 references
    0 references
    11 November 2013
    0 references
    computational complexity
    0 references
    polynomial time algorithms
    0 references
    graph
    0 references
    vertex partition
    0 references
    coloring
    0 references
    homomorphism
    0 references
    compaction
    0 references
    retraction
    0 references
    vertex-compaction
    0 references

    Identifiers