On 2-clubs in graph-based data clustering: theory and algorithm engineering (Q2692726): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q175575
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Rolf Niedermeier / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: solverALL / 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-3-030-75242-2_15 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3165512526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation and tidying -- a problem kernel for \(s\)-plex cluster vertex deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster Editing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Going weighted: parameterized algorithms for cluster editing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for cluster editing: Evaluation and experiments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization Lower Bounds by Cross-Composition / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast branching algorithm for cluster vertex deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the tractability of covering a graph with 2-clubs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering a Graph with Clubs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the tractability of finding disjoint clubs in a network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster Vertex Deletion: A Parameterization between Vertex Cover and Clique-Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-based data clustering with overlaps / rank
 
Normal rank
Property / cites work
 
Property / cites work: The parametric complexity of graph diameter augmentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-modeled data clustering: Exact algorithms for clique generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A More Relaxed Model for Graph-Based Data Clustering: <i>s</i>-Plex Cluster Editing / 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: Fixed-parameter algorithms for cluster vertex deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster editing with locally bounded modifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: theory and experiments / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Editing Graphs into 2-Club Clusters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness of r-dominating set on Graphs of Diameter (r + 1) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subexponential algorithm for \(d\)-cluster edge deletion: exception or rule? / 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: Cluster graph modification problems / rank
 
Normal rank

Latest revision as of 19:22, 31 July 2024

scientific article
Language Label Description Also known as
English
On 2-clubs in graph-based data clustering: theory and algorithm engineering
scientific article

    Statements

    On 2-clubs in graph-based data clustering: theory and algorithm engineering (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    22 March 2023
    0 references
    0 references
    0 references
    0 references