Moderately exponential time algorithms for the maximum bounded-degree-1 set problem (Q1627852): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q115577869, #quickstatements; #temporary_batch_1707303357582
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2018.05.032 / 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.1016/j.dam.2018.05.032 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2808514443 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique Relaxations in Social Network Analysis: The Maximum <i>k</i>-Plex Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for finding and partitioning unit-disk graphs into co-\(k\)-plexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On bounded-degree vertex deletion parameterized by treewidth / 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: Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter algorithms for Vertex Cover \(P_3\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Kernel for Co-Path/Cycle Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of approximating minimum vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of Nemhauser and Trotter's local optimization theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized parameterized algorithms for \(P_2\)-packing and co-path packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact exponential algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approximation algorithm for node-deletion problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Bounded Degree Deletion via Matroid Matching / 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: On computing the minimum 3-path vertex cover and dissociation number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isolation concepts for efficiently enumerating dense subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial algorithms for the maximum \(k\)-plex problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach for approximating node deletion 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: A factor \(2\) approximation algorithm for the vertex cover \(P_3\) problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual approximation algorithm for the vertex cover \(P^3\) problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved kernelization for \(P_{2}\)-packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Measure and Conquer Approach for the Parameterized Bounded Degree-One Vertex Deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization and Parameterized Algorithms for 3-Path Vertex Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for maximum independent set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002782 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2018.05.032 / rank
 
Normal rank

Latest revision as of 23:34, 10 December 2024

scientific article
Language Label Description Also known as
English
Moderately exponential time algorithms for the maximum bounded-degree-1 set problem
scientific article

    Statements

    Moderately exponential time algorithms for the maximum bounded-degree-1 set problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    3 December 2018
    0 references
    bounded-degree-1 set
    0 references
    2-plex
    0 references
    vertex cover P3
    0 references
    exact algorithm
    0 references
    approximation algorithm
    0 references
    0 references

    Identifiers