k-NLC graphs and polynomial algorithms
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3889564 (Why is no real title available?)
- scientific article; zbMATH DE number 3896983 (Why is no real title available?)
- scientific article; zbMATH DE number 4060712 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A linear time algorithm for finding tree-decompositions of small treewidth
- An axiomatic definition of context-free rewriting and its application to NLC graph grammars
- Complexity of Finding Embeddings in a k-Tree
- Dacey Graphs
- Easy problems for tree-decomposable graphs
- Graph grammars with neighbourhood-controlled embedding
- Graph minors. II. Algorithmic aspects of tree-width
- Hyperedge replacement: grammars and languages
- Linear-time computation of optimal subgraphs of decomposable graphs
- On simple characterizations of k-trees
- On the structure of node-label-controlled graph languages
- Restrictions, extensions, and variations of NLC grammars
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
Cited in
(62)- Directed NLC-width
- Characterizations for co-graphs defined by restricted NLC-width or clique-width operations
- scientific article; zbMATH DE number 1420903 (Why is no real title available?)
- Feferman-vaught decompositions for prefix classes of first order logic
- GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH
- On low rank-width colorings
- Efficient parameterized algorithms for computing all-pairs shortest paths
- Algorithmic uses of the Feferman-Vaught theorem
- Polynomial-time recognition of clique-width 3 graphs
- On switching classes, NLC-width, cliquewidth and treewidth
- Vertex disjoint paths on clique-width bounded graphs
- On a disparity between relative cliquewidth and relative NLC-width
- Recent developments on graphs of bounded clique-width
- On the expressive power of permanents and perfect matchings of matrices of bounded pathwidth/cliquewidth
- Constrained-path labellings on graphs of bounded clique-width
- Fast FPT-approximation of branchwidth
- Eigenvalue location in graphs of small clique-width
- Edge dominating set and colorings on graphs with fixed clique-width
- Knocking out \(P_k\)-free graphs
- Vertex-minors, monadic second-order logic, and a conjecture by Seese
- On the clique-width of graph with few \(P_{4}\)'s
- The Clique-Width of Tree-Power and Leaf-Power Graphs
- On powers of graphs of bounded NLC-width (clique-width)
- A local characterization of bounded clique-width for line graphs
- Definable decompositions for graphs of bounded linear cliquewidth
- Tight complexity bounds for FPT subgraph problems parameterized by clique-width
- Comparing linear width parameters for directed graphs
- Well-quasi-order of relabel functions
- Upper bounds to the clique width of graphs
- On algorithms for (P₅, gem)-free graphs
- The most vital nodes with respect to independent set and vertex cover
- Line graphs of bounded clique-width
- \(b\)-coloring parameterized by clique-width
- Characterizations for restricted graphs of NLC-width 2
- NLC\(_{2}\)-decomposition in polynomial time
- Graph operations characterizing rank-width
- The NLC-width and clique-width for powers of graphs of bounded tree-width
- Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems
- Approximating clique-width and branch-width
- Linear layouts measuring neighbourhoods in graphs
- Locating Eigenvalues of Symmetric Matrices - A Survey
- Rank-width: algorithmic and structural results
- On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
- The recognizability of sets of graphs is a robust property
- A model-theoretic characterisation of clique width
- Graph Operations Characterizing Rank-Width and Balanced Graph Expressions
- On \textsf{NC} algorithms for problems on bounded rank-width graphs
- Inductive computations on graphs defined by clique-width expressions
- On the relationship between NLC-width and linear NLC-width
- Classes of graphs with low complexity: the case of classes with bounded linear rankwidth
- Linear clique-width for hereditary classes of cographs
- A unified method for placing problems in polylogarithmic depth
- Digraphs of bounded width
- On the Expressive Power of Permanents and Perfect Matchings of Matrices of Bounded Pathwidth/Cliquewidth (Extended Abstract)
- Clique-width of graphs defined by one-vertex extensions
- The behavior of clique-width under graph operations and graph transformations
- Inapproximability of rank, clique, Boolean, and maximum induced matching-widths under small set expansion hypothesis
- scientific article; zbMATH DE number 7029306 (Why is no real title available?)
- Tight complexity bounds for FPT subgraph problems parameterized by the clique-width
- H-product of graphs, H-threshold graphs and threshold-width of graphs
- Parameterized complexity of distance labeling and uniform channel assignment problems
- Revising Johnson's table for the 21st century
This page was built for publication: \(k\)-NLC graphs and polynomial algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1336631)
