Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: theory and experiments (Q1719617): Difference between revisions

From MaRDI portal
Changed an Item
Created claim: Wikidata QID (P12): Q128701273, #quickstatements; #temporary_batch_1724813321913
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2883786747 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1807.07516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analytical comparison of the LP relaxations of integer models for the \(k\)-club problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal approximation algorithms for maximum distance-bounded subgraph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On robust clusters of minimum cardinality in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Novel approaches for analyzing biological networks / 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: Upper bounds and heuristics for the 2-club problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The triangle \(k\)-club problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding large \(k\)-clubs in undirected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal Flow Through a Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the Vertex Connectivity of Graphs / 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: Finding clubs in graph classes / 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: Which problems have strongly exponential complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multivariate algorithmics for finding cohesive subnetworks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4967164 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Managing and mining graph data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4904144 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / 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 clique relaxation models in 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: Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding maximum subgraphs with relatively large vertex connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On biconnected and fragile subgraphs of low diameter / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128701273 / rank
 
Normal rank

Latest revision as of 09:36, 28 August 2024

scientific article
Language Label Description Also known as
English
Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: theory and experiments
scientific article

    Statements

    Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: theory and experiments (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    11 February 2019
    0 references
    combinatorial optimization
    0 references
    fixed-parameter tractability
    0 references
    small-diameter subgraphs
    0 references
    graph mining
    0 references
    community detection
    0 references
    0 references
    0 references
    0 references

    Identifiers

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