Directed NLC-width
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1696534 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1161563 (Why is no real title available?)
- scientific article; zbMATH DE number 2044928 (Why is no real title available?)
- scientific article; zbMATH DE number 1472167 (Why is no real title available?)
- A complete axiomatisation for the inclusion of series-parallel partial orders
- A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width
- Algorithmic lower bounds for problems parameterized by clique-width
- Algorithms for vertex-partitioning problems on graphs with fixed clique-width.
- Approximating clique-width and branch-width
- Are there any good digraph width measures?
- Clique-width is NP-complete
- Clique-width of graphs defined by one-vertex extensions
- Clique-width: on the price of generality
- Clique-width: when hard does not mean impossible
- Complexity of Finding Embeddings in a k-Tree
- Deciding Clique-Width for Graphs of Bounded Tree-Width
- Digraph measures: Kelly decompositions, games, and orderings
- Digraph width measures in parameterized algorithmics
- Digraphs
- Directed tree-width
- Directed tree-width examples
- Edge dominating set and colorings on graphs with fixed clique-width
- Every 7-regular digraph contains an even cycle
- Fully dynamic recognition algorithm and certificate for directed cographs
- Fundamentals of parameterized complexity
- Graph minors. II. Algorithmic aspects of tree-width
- Line graphs of bounded clique-width
- Linear time solvable optimization problems on graphs of bounded clique-width
- MSOL partitioning problems on graphs of bounded treewidth and clique-width
- Model-checking by infinite fly-automata
- Parametrized complexity theory.
- Polynomial algorithms for protein similarity search for restricted mRNA structures
- S-functions for graphs
- The dag-width of directed graphs
- The rank-width of edge-coloured graphs
- Upper bounds to the clique width of graphs
- Vertex disjoint paths on clique-width bounded graphs
- \(k\)-NLC graphs and polynomial algorithms
Cited in
(18)- Acyclic coloring parameterized by directed clique-width
- Efficient parameterized algorithms for computing all-pairs shortest paths
- On a disparity between relative cliquewidth and relative NLC-width
- Twin-distance-hereditary digraphs
- Computing directed Steiner path covers
- Efficient computation of the oriented chromatic number of recursively defined digraphs
- Homomorphisms to digraphs with large girth and oriented colorings of minimal series-parallel digraphs
- Computing directed Steiner path covers for directed co-graphs (extended abstract)
- Oriented coloring on recursively defined digraphs
- On characterizations for subclasses of directed co-graphs
- Comparing linear width parameters for directed graphs
- Solutions for subset sum problems with special digraph constraints
- Directed width parameters on semicomplete digraphs
- NLC\(_{2}\)-decomposition in polynomial time
- NLC-2 Graph Recognition and Isomorphism
- How to compute digraph width measures on directed co-graphs
- Digraphs of bounded width
- The behavior of clique-width under graph operations and graph transformations
This page was built for publication: Directed NLC-width
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q906393)
