Parameterized Complexity of Safe Set (Q5119377): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.7155/jgaa.00528 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3019773202 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Safe sets in graphs: graph classes and structural parameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Safe sets, network majority on weighted trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3789603 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(k\)-separator problem: polyhedra, complexity and approximation results / rank
 
Normal rank
Property / cites work
 
Property / cites work: On problems without polynomial kernels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5111866 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds to the clique width of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization Lower Bounds Through Colors and IDs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Parameter Tractability and Completeness I: Basic Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of vertex integrity and component order connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating connected safe sets in weighted trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Layout Problems Parameterized by Vertex Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: An application of simultaneous diophantine approximation in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of first-order and monadic second-order logic revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Safe number and integrity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the weighted safe set problem on paths and cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Safe set problem on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized algorithms for generalizations of directed feedback vertex set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Branch-Decompositions and Rank-Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minkowski's Convex Body Theorem and Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measuring the vulnerability for classes of intersection graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4634403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic meta-theorems for restrictions of treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning a graph into small pieces with applications to path transversal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming with a Fixed Number of Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vulnerability parameters of split graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular decomposition and transitive orientation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating rank-width and clique-width quickly / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating clique-width and branch-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3428636 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations / rank
 
Normal rank

Latest revision as of 10:19, 23 July 2024

scientific article; zbMATH DE number 7243659
Language Label Description Also known as
English
Parameterized Complexity of Safe Set
scientific article; zbMATH DE number 7243659

    Statements

    Parameterized Complexity of Safe Set (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    4 September 2020
    0 references
    safe set
    0 references
    parameterized complexity
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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