Boolean-width of graphs (Q719257): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2011.05.022 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2154682992 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Boolean-Width of a Graph: Structure and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2784326 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes with Structured Neighborhoods and Algorithmic Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth computations. I: Upper bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Algorithms on Branch and Clique Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feedback Vertex Set on Graphs of Low Cliquewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Relationship Between Clique-Width and Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handle-rewriting hypergraph grammars / 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: Q4938660 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-width and well-quasi-ordering in matroids and graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5592270 / 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: PARTITION REFINEMENT TECHNIQUES: AN INTERESTING ALGORITHMIC TOOL KIT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Branch-Decompositions and Rank-Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Good Decompositions for Dynamic Programming on Dense Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Rank-Width of the Square Grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4489221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3958592 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge dominating set and colorings on graphs with fixed clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank-width of random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank‐width is less than or equal to branch‐width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating clique-width and branch-width / 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: Q4352948 / 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: Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution / 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: Row space cardinalities / rank
 
Normal rank

Latest revision as of 12:47, 4 July 2024

scientific article
Language Label Description Also known as
English
Boolean-width of graphs
scientific article

    Statements

    Boolean-width of graphs (English)
    0 references
    0 references
    0 references
    0 references
    10 October 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    graph decomposition
    0 references
    FPT algorithm
    0 references
    width parameter
    0 references
    Boolean algebra
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references