MSOL partitioning problems on graphs of bounded treewidth and clique-width (Q884481): 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.2007.03.043 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2008361472 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easy problems for tree-decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Achromatic number is NP-complete for cographs and interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4291429 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / 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: The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second order logic of graphs. VI: On several representations of graphs by relational structures / 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: Vertex-minors, monadic second-order logic, and a conjecture by Seese / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4850061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4448752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding Clique-Width for Graphs of Bounded Tree-Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: The first order properties of products of algebraic systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for vertex-partitioning problems on graphs with fixed clique-width. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5572332 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4283244 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5487903 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic uses of the Feferman-Vaught theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating clique-width and branch-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic theory of order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Vertex Partitioning Problems on Partial k-Trees / rank
 
Normal rank

Latest revision as of 19:44, 25 June 2024

scientific article
Language Label Description Also known as
English
MSOL partitioning problems on graphs of bounded treewidth and clique-width
scientific article

    Statements

    MSOL partitioning problems on graphs of bounded treewidth and clique-width (English)
    0 references
    0 references
    6 June 2007
    0 references
    graph algorithms
    0 references
    monadic second-order logic
    0 references
    vertex partitioning
    0 references
    clique-width
    0 references
    treewidth
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references