Level of repair analysis and minimum cost homomorphisms of graphs (Q2492189): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On Finding Critical Independent and Vertex Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Algorithms for Bipartite Network Flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4208001 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4225582 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial approach to level of repair analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3351135 / rank
 
Normal rank
Property / cites work
 
Property / cites work: List homomorphisms and circular arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial algorithm for weighted stable sets in bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of H-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4869540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Critical Independent Sets and Critical Vertex Subsets are Polynomial Problems / rank
 
Normal rank

Latest revision as of 16:36, 24 June 2024

scientific article
Language Label Description Also known as
English
Level of repair analysis and minimum cost homomorphisms of graphs
scientific article

    Statements

    Level of repair analysis and minimum cost homomorphisms of graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    9 June 2006
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    computational logistics
    0 references
    level of repair analysis
    0 references
    independent sets in graphs
    0 references
    homomorphisms of graphs
    0 references
    0 references