Combinatorics for smaller kernels: the differential of a graph (Q476877): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: DBLP publication ID (P1635): journals/tcs/BermudoF15, #quickstatements; #temporary_batch_1731508824982
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: An Improved Approximation Bound for Spanning Star Forest and Color Saving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the differential of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the differential of a graph: hardness, approximability and exact algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The differential and the roman domination number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for the test cover problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for the spanning star forest problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Roman domination in graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOFSEM 2006: Theory and Practice of Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: R<scp>OMAN DOMINATION</scp>: a parameterized perspective† / rank
 
Normal rank
Property / cites work
 
Property / cites work: Defending the Roman Empire---a new strategy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for the Set Covering and Vertex Cover Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Size of Systems of Sets Every <i>t</i> of which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonblocker in H-Minor Free Graphs: Kernelization Meets Discharging / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5488331 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination in graphs with minimum degree two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex packings: Structural properties and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Spanning Star Forest Problem and Its Application to Genomic Sequence Alignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Stars and the Number Three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enclaveless sets and MK-Systems / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/tcs/BermudoF15 / rank
 
Normal rank

Latest revision as of 15:41, 13 November 2024

scientific article
Language Label Description Also known as
English
Combinatorics for smaller kernels: the differential of a graph
scientific article

    Statements

    Combinatorics for smaller kernels: the differential of a graph (English)
    0 references
    0 references
    0 references
    2 December 2014
    0 references
    parameterized algorithm
    0 references
    kernelization
    0 references
    approximation algorithm
    0 references
    combinatorial bounds
    0 references
    differential of a graph
    0 references

    Identifiers