Solving problems on generalized convex graphs via mim-width (Q6183361): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Graph classes with structured neighborhoods and algorithmic applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5075752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node multiway cut and subset feedback vertex set on graphs of bounded mim-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the thinness and proper thinness of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem / 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: Thinness of product graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5463359 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2954991 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding the mim‐width of hereditary graph classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: List \(k\)-colouring \(P_t\)-free graphs: a mim-width perspective / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Planar Supports for Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boolean-width of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(H\)-topological intersection graphs / 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: Polynomial-Time Data Reduction for the Subset Interconnection Design Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard coloring problems in low degree planar bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: List 3-coloring \(P_t\)-free graphs with no induced 1-subdivision of \(K_{1 , s}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds to the clique width of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: List coloring in the absence of a linear forest / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique-width for hereditary graph classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On list \(k\)-coloring convex bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5315023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of colouring problems on dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: List Partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching in a convex bipartite graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding \(k\)-colorability of \(P_5\)-free graphs in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear MIM-width of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Precoloring Extension III: Classes of Perfect Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mim-width. II. The feedback vertex set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feedback vertex sets on restricted bipartite graphs / 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: Recent developments on graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: A width parameter useful for chordal and co-comparability graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular convex bipartite graphs: Maximum matching and Hamiltonian circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted Bipartite Graphs: Comparison and Hardness Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular convex bipartite graphs: feedback vertex sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractable connected domination for restricted bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent Domination: Reductions from Circular- and Triad-Convex Bipartite Graphs to Convex Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The stable set problem and the thinness of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal greedy heuristic to color interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating clique-width and branch-width / 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: Maximum weight 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: A unified approach to domination problems on interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique-width of graphs defined by one-vertex extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588432 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. X: Obstructions to tree-decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness of computing width parameters based on branch decompositions over the vertex set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent Domination on Tree Convex Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Vertex Partitioning Problems on Partial k-Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree Convex Bipartite Graphs: $\mathcal{NP}$ -Complete Domination, Hamiltonicity and Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feedback Vertex Sets on Tree Convex Bipartite Graphs / rank
 
Normal rank

Revision as of 10:22, 22 August 2024

scientific article; zbMATH DE number 7783118
Language Label Description Also known as
English
Solving problems on generalized convex graphs via mim-width
scientific article; zbMATH DE number 7783118

    Statements

    Solving problems on generalized convex graphs via mim-width (English)
    0 references
    0 references
    0 references
    0 references
    4 January 2024
    0 references
    convex graph
    0 references
    mim-width
    0 references
    width parameter
    0 references
    polynomial-time algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers