The behavior of clique-width under graph operations and graph transformations (Q519907): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00224-016-9685-1 / rank
Normal rank
 
Property / arXiv ID
 
Property / arXiv ID: cs/0701185 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time algorithms for NP-hard problems restricted to partial k- trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial k-arboretum of graphs with bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4425939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circle graph obstructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: New graph classes of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bandwidth problem and operations on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On deciding switching equivalence of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time recognition of clique-width \(\leq 3\) graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Recognition Algorithm for Cographs / 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. XV: On a conjecture by D. Seese / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique-width and edge contraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fly-automata for checking monadic second-order properties of graphs of bounded tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata for the verification of monadic second-order graph properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3077955 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handle-rewriting hypergraph grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterisation of clique-width through nested partitions / 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: Upper bounds to the clique width of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained-path labellings on graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bi-join decomposition / 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: Clique-Width is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the corona of two graphs / 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: Q2766682 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the relationship between NLC-width and linear NLC-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex disjoint paths on clique-width bounded graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Line graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed NLC-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic algorithms for graphs of bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: S-functions for graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5572939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing \(P_ 3\)-structure: A switching approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: A SAT Approach to Clique-Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4523707 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4857375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4489221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: <font>NLC</font><sub>2</sub>-DECOMPOSITION IN POLYNOMIAL TIME / 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: Edge dominating set and colorings on graphs with fixed clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for generalized vertex-rankings of partial k-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicut on Graphs of Bounded Clique-Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Seidel Minor, Permutation Graphs and Combinatorial Properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: NLC-2 Graph Recognition and Isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chordal bipartite graphs of bounded tree- and clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree / 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 and vertex-minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating clique-width and branch-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3684139 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4065580 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3931443 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On powers of graphs of bounded NLC-width (clique-width) / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k\)-NLC graphs and polynomial algorithms / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00224-016-9685-1 / rank
 
Normal rank

Latest revision as of 20:14, 9 December 2024

scientific article
Language Label Description Also known as
English
The behavior of clique-width under graph operations and graph transformations
scientific article

    Statements

    The behavior of clique-width under graph operations and graph transformations (English)
    0 references
    0 references
    31 March 2017
    0 references
    clique-width
    0 references
    NLC-width
    0 references
    graph operations
    0 references
    graph transformations
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    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