On convexity in split graphs: complexity of Steiner tree and domination (Q6123388): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A kernelization algorithm for \(d\)-hitting set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unique Covering Problems with Geometric Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving problems on generalized convex graphs via mim-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Steiner tree algorithms for bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination in convex and chordal bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incompressibility through Colors and IDs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Hardness Results on Feedback Vertex Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractable Feedback Vertex Sets in Restricted Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating induced matching in some subclasses of bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination in some subclasses of bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner tree in \(K_{1,r}\)-free split graphs -- a dichotomy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3663321 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner trees, partial 2–trees, and minimum IFI networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner trees, connected domination and strongly chordal graphs / rank
 
Normal rank

Latest revision as of 14:46, 27 August 2024

scientific article; zbMATH DE number 7812587
Language Label Description Also known as
English
On convexity in split graphs: complexity of Steiner tree and domination
scientific article; zbMATH DE number 7812587

    Statements

    On convexity in split graphs: complexity of Steiner tree and domination (English)
    0 references
    0 references
    0 references
    0 references
    4 March 2024
    0 references
    Steiner tree
    0 references
    domination
    0 references
    split graphs
    0 references
    tree-convex
    0 references
    circular-convex split graphs
    0 references
    parameterized complexity
    0 references

    Identifiers