Maximum Minimal Vertex Cover Parameterized by Vertex Cover (Q2946427): 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.1007/978-3-662-48054-0_49 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2400752627 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved fixed-parameter algorithm for vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4601874 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparsification and subexponential approximation / 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: Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A novel parameterised approximation algorithm for \textsc{minimum vertex cover} / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterminism within $P^ * $ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Refined memorization for vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth and Pathwidth Parameterized by the Vertex Cover Number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex Cover: Further Observations and Further Improvements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labeled search trees and amortized analysis: Improved upper bounds for NP-hard problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved upper bounds for vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4506265 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crown reductions for the minimum weighted vertex cover problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Problems as Hard as CNF-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter tractability and completeness II: On completeness for W[1] / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263467 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards fully multivariate algorithmics: parameter ecology and the deconstruction of computational complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Approximation via Fidelity Preserving Transformations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching and Treewidth Based Exact Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On two techniques of combining branching and treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms parameterized by vertex cover and modular width, through potential maximal cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating minimum independent dominating sets in wireless networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4251072 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On efficient fixed-parameter algorithms for weighted vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster computation of maximum independent set and parameterized vertex cover for graphs with maximum degree 3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multivariate framework for weighted FPT algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Vertex Cover in Graphs with Maximum Degree 3 / rank
 
Normal rank

Latest revision as of 19:23, 10 July 2024

scientific article
Language Label Description Also known as
English
Maximum Minimal Vertex Cover Parameterized by Vertex Cover
scientific article

    Statements

    Maximum Minimal Vertex Cover Parameterized by Vertex Cover (English)
    0 references
    0 references
    16 September 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references