Distance-Based Clique Relaxations in Networks: s-Clique and s-Club (Q2820114): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Q200487 / rank
Normal rank
 
Property / author
 
Property / author: Sergiy I. Butenko / rank
 
Normal rank
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/978-1-4614-8588-9_10 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2203716775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3044359 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competition in a deregulated air transportation market / rank
 
Normal rank
Property / cites work
 
Property / cites work: A graph‐theoretic definition of a sociometric clique† / rank
 
Normal rank
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: Proof verification and the hardness of approximation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic checking of proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Maximum Diameter-Bounded Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5294075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Novel approaches for analyzing biological networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3852212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3682518 / 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: On connected dominating sets of restricted diameter / 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: Upper bounds and heuristics for the 2-club problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong computational lower bounds via parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unit disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum degree \& diameter-bounded subgraph and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4342632 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: And What Is Your Erdos Number? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On structural parameterizations for the 2-club problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Airline network design and hub location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial 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: On approximating the maximum diameter ratio of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Structure and Function of Complex Networks / 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: Clique Relaxation Models in Social Network Analysis / 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: A graph‐theoretic generalization of the clique concept / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the maximum \(k\)-club problem in graphs / 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
Property / cites work
 
Property / cites work: Q3002782 / rank
 
Normal rank

Latest revision as of 14:38, 12 July 2024

scientific article
Language Label Description Also known as
English
Distance-Based Clique Relaxations in Networks: s-Clique and s-Club
scientific article

    Statements

    Distance-Based Clique Relaxations in Networks: s-Clique and s-Club (English)
    0 references
    0 references
    0 references
    13 September 2016
    0 references
    0 references
    clique relaxations
    0 references
    s-clique
    0 references
    s-club
    0 references
    maximum clique
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references