Polynomial-time recognition of clique-width \(\leq 3\) graphs (Q415285): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Derek Gordon Corneil / rank
Normal rank
 
Property / author
 
Property / author: Bruce A. Reed / rank
Normal rank
 
Property / author
 
Property / author: Derek Gordon Corneil / rank
 
Normal rank
Property / author
 
Property / author: Bruce A. Reed / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C69 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C70 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C85 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6033766 / rank
 
Normal rank
Property / zbMATH Keywords
 
clique-width computation
Property / zbMATH Keywords: clique-width computation / rank
 
Normal rank
Property / zbMATH Keywords
 
polynomial-time algorithm
Property / zbMATH Keywords: polynomial-time algorithm / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2011.03.020 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2067475075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4291429 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transforming trees by successive local complementations / 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: GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure and stability number of chair-, co-P- and gem-free graphs revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Algorithm for the Decomposition of Graphs and Posets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4508369 / 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: Upper bounds to the clique width of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4954442 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501779 / 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: Algorithms for vertex-partitioning problems on graphs with fixed clique-width. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / 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: Line graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of the algorithmic aspects of modular decomposition / 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: 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: Edge dominating set and colorings on graphs with fixed clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: NLC-2 Graph Recognition and Isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(n2) Algorithm for Undirected Split Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular decomposition and transitive orientation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating rank-width and clique-width quickly / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating clique-width and branch-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k\)-NLC graphs and polynomial algorithms / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 05:22, 5 July 2024

scientific article
Language Label Description Also known as
English
Polynomial-time recognition of clique-width \(\leq 3\) graphs
scientific article

    Statements

    Polynomial-time recognition of clique-width \(\leq 3\) graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    11 May 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    clique-width computation
    0 references
    polynomial-time algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references