Detecting robust cliques in graphs subject to uncertain edge failures (Q1640046): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10479-016-2161-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2299449272 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945528 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3145799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique-detection models in computational biochemistry and genomics / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-neighborhood tabu search for the maximum weight clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A review on algorithms for maximum clique problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5456740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Maximum Clique and Vertex Coloring Problems on Very Large Sparse Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A probabilistic heuristic for a computationally difficult set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy randomized adaptive search procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: STABULUS: A technique for finding stable sets in large graphs with tabu search / 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: Future paths for integer programming and links to artificial intelligence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assessing experimentally derived interactions in a small world / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the maximum probabilistic clique problem / 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: On clique relaxation models in network analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: On risk-averse maximum weighted subgraph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A graph‐theoretic generalization of the clique concept / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diversification strategies in tabu search algorithms for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4452109 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive multistart tabu search approach to solve the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-and edge-deletion NP-complete problems / rank
 
Normal rank

Latest revision as of 21:39, 15 July 2024

scientific article
Language Label Description Also known as
English
Detecting robust cliques in graphs subject to uncertain edge failures
scientific article

    Statements

    Detecting robust cliques in graphs subject to uncertain edge failures (English)
    0 references
    0 references
    0 references
    0 references
    13 June 2018
    0 references
    maximum clique
    0 references
    robust clique
    0 references
    conditional value-at-risk
    0 references
    heuristic
    0 references
    tabu search
    0 references
    GRASP
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers