Maximum weight independent set for \(\ell\)claw-free graphs in polynomial time (Q1701093): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2964197964 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1602.05838 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial algorithm for finding the largest independent sets in graphs without forks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On easy and hard hereditary classes of graphs with respect to the independent set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs with polynomially solvable maximum-weight clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent Sets of Maximum Weight in Apple-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent Sets of Maximum Weight in Apple-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365068 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: On diameters and radii of bridged graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / 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: From matchings to independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm to find an independent set of maximum weight in a fork-free graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent sets in extensions of 2\(K_{2}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum regular induced subgraphs in \(2P_3\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximal independent sets of vertices in claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A REVISION OF MINTY'S ALGORITHM FOR FINDING A MAXIMUM WEIGHT STABLE SET OF A CLAW-FREE GRAPH / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reduction algorithm for the weighted stable set problem in claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(\mathcal{O}(m\log n)\) algorithm for the weighted stable set problem in claw-free graphs with \(\alpha ({G}) \leq 3\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4770411 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm for Generating All the Maximal Independent Sets / rank
 
Normal rank

Latest revision as of 05:44, 15 July 2024

scientific article
Language Label Description Also known as
English
Maximum weight independent set for \(\ell\)claw-free graphs in polynomial time
scientific article

    Statements

    Maximum weight independent set for \(\ell\)claw-free graphs in polynomial time (English)
    0 references
    0 references
    0 references
    22 February 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    maximum weight independent set problem
    0 references
    \(\ell\)claw-free graphs
    0 references
    polynomial time
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references