Extension and its price for the connected vertex cover problem (Q2072064): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2021.11.028 / rank
Normal rank
 
Property / cites work
 
Property / cites work: On the Complexity Landscape of the Domination Chain / rank
 
Normal rank
Property / cites work
 
Property / cites work: The many facets of upper domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the max min vertex cover problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual subimplicants of positive Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected vertex covers in dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of independency and cliquy trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extension of Vertex Cover and Independent Set in some classes of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of solution extension of optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extension of some edge graph problems: standard and parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Parameterized Connected Vertex Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4511217 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination, independent domination, and duality in strongly chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOFSEM 2005: Theory and Practice of Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex and edge covers with clustering properties: Complexity and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Rectilinear Steiner Tree Problem is $NP$-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration and maximum number of minimal connected vertex covers in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weakly triangulated graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Enumeration of Minimal Dominating Sets and Related Notions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A \(9k\) kernel for nonseparating independent set in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Revisiting connected vertex cover: FPT algorithms and lossy kernels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial kernels for vertex cover parameterized by small degree modulators / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the approximate compressibility of connected vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the algorithmic complexity of twelve covering and independence parameters of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-first search and the vertex cover problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On feedback vertex sets and nonseparating independent sets in cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4505399 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum Minimal Vertex Cover Parameterized by Vertex Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002782 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2021.11.028 / rank
 
Normal rank

Latest revision as of 23:13, 16 December 2024

scientific article
Language Label Description Also known as
English
Extension and its price for the connected vertex cover problem
scientific article

    Statements

    Extension and its price for the connected vertex cover problem (English)
    0 references
    0 references
    0 references
    0 references
    1 February 2022
    0 references
    extension problems
    0 references
    connected vertex cover
    0 references
    upper connected vertex cover
    0 references
    price of extension
    0 references
    special graph classes
    0 references
    approximation algorithms
    0 references
    \( \mathsf{NP} \)-completeness
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers