Tackling the maximum happy vertices problem in large networks (Q2026712): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On the parameterized complexity of happy vertex coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Time Algorithms for Happy Vertex Coloring Problems for Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3452868 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A graph coloring heuristic using partial solutions and a reactive tabu scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2779804 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysing the effects of solution space connectivity with an effective metaheuristic for the course timetabling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding happiness: an analysis of the maximum happy vertices problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic aspects of homophyly of networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a parallel genetic-tabu search based algorithm for solving the graph colouring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for the maximum happy vertices and edges problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph colouring approaches for a satellite range scheduling problem / rank
 
Normal rank

Revision as of 19:14, 25 July 2024

scientific article
Language Label Description Also known as
English
Tackling the maximum happy vertices problem in large networks
scientific article

    Statements

    Tackling the maximum happy vertices problem in large networks (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    20 May 2021
    0 references
    tabu search
    0 references
    graph colouring
    0 references
    maximum happy vertices problem
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references