Algorithms for the maximum \(k\)-club problem in graphs (Q385488): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Integer models and upper bounds for the 3‐club problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variable neighborhood search for graph coloring. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Novel approaches for analyzing biological networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3145799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for finding \(k\)-clubs in an undirected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the maximum \(k\)-club problem in an undirected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: New methods to color the vertices of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds and heuristics for the 2-club problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The parallel variable neighborhood search for the \(p\)-median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local search and suffix tree for car-sequencing problem with colors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the maximum clique problem using a tabu search approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of metaheuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search: Principles and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search for the maximum clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient variable neighborhood search heuristic for very large scale vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighborhood structures for the container loading problem: a VNS implementation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized computational complexity of finding small-diameter subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems / rank
 
Normal rank

Latest revision as of 03:39, 7 July 2024

scientific article
Language Label Description Also known as
English
Algorithms for the maximum \(k\)-club problem in graphs
scientific article

    Statements

    Algorithms for the maximum \(k\)-club problem in graphs (English)
    0 references
    0 references
    0 references
    2 December 2013
    0 references
    maximum \(k\)-club
    0 references
    clique relaxations
    0 references
    variable neighborhood search
    0 references
    0 references

    Identifiers