A polynomial Turing-kernel for weighted independent set in bull-free graphs (Q521799): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(8 intermediate revisions by 6 users not shown)
Property / author
 
Property / author: Steéphan Thomassé / rank
Normal rank
 
Property / author
 
Property / author: Steéphan Thomassé / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C15 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C69 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C85 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6705186 / rank
 
Normal rank
Property / zbMATH Keywords
 
FPT algorithm
Property / zbMATH Keywords: FPT algorithm / rank
 
Normal rank
Property / zbMATH Keywords
 
kernel
Property / zbMATH Keywords: kernel / rank
 
Normal rank
Property / zbMATH Keywords
 
Turing-kernel
Property / zbMATH Keywords: Turing-kernel / rank
 
Normal rank
Property / zbMATH Keywords
 
bull-free graph
Property / zbMATH Keywords: bull-free graph / rank
 
Normal rank
Property / zbMATH Keywords
 
stable set
Property / zbMATH Keywords: stable set / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59889903 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1617257399 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1310.6205 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3503433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On problems without polynomial kernels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum weight independent sets in odd-hole-free graphs without dart or without bull / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of bull-free graphs I -- three-edge-paths with centers and anticenters / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of bull-free graphs II and III -- a summary / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the density of families of sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing Berge graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365068 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-partitioning into fixed additive induced-hereditary properties is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5749319 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Some H-Join Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of the algorithmic aspects of modular decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Completeness Theory for Polynomial (Turing) Kernelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turing kernelization for finding long paths and cycles in restricted graph classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent Set in <i>P</i><sub>5</sub>-Free Graphs in Polynomial Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm Theory - SWAT 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4770411 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Chromatic Number of Subgraphs of a Given Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved FPT algorithms for weighted independent set in bull-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Turing-Kernel for Weighted Independent Set in Bull-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm for Generating All the Maximal Independent Sets / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:55, 13 July 2024

scientific article
Language Label Description Also known as
English
A polynomial Turing-kernel for weighted independent set in bull-free graphs
scientific article

    Statements

    A polynomial Turing-kernel for weighted independent set in bull-free graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    12 April 2017
    0 references
    FPT algorithm
    0 references
    kernel
    0 references
    Turing-kernel
    0 references
    bull-free graph
    0 references
    stable set
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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