Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes (Q3000488): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Vadim V. Lozin / rank
Normal rank
 
Property / author
 
Property / author: Vadim V. Lozin / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-19222-7_1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1497268659 / 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: Augmenting graphs for independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: TWO THEOREMS IN GRAPH THEORY / rank
 
Normal rank
Property / cites work
 
Property / cites work: An augmenting graph approach to the stable set problem in \(P_{5}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time solvable optimization problems on graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential speedup of fixed-parameter algorithms for classes of graphs excluding single-crossing graphs as minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: The independence number of graphs with large odd girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primitivity is hereditary for 2-structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterized complexity of multiple-interval graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitiv orientierbare Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the X-join decomposition for undirected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4886045 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed Parameter Tractability of Independent Set in Segment Intersection Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of the maximum independent set problem and the speed of hereditary properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability preserving transformations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finding augmenting graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular decomposition and transitive orientation / 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: Q3686754 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable sets in certain \(P_6\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing independent sets in graphs with large girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the homogeneous representation of interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangles, 4-Cycles and Parameterized (In-)Tractability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving some NP-complete problems using split decomposition / rank
 
Normal rank

Latest revision as of 02:21, 4 July 2024

scientific article
Language Label Description Also known as
English
Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes
scientific article

    Statements

    Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    19 May 2011
    0 references
    0 references
    0 references
    0 references
    0 references