Pages that link to "Item:Q1336631"
From MaRDI portal
The following pages link to \(k\)-NLC graphs and polynomial algorithms (Q1336631):
Displaying 50 items.
- Tight complexity bounds for FPT subgraph problems parameterized by the clique-width (Q388791) (← links)
- \(H\)-product of graphs, \(H\)-threshold graphs and threshold-width of graphs (Q389453) (← links)
- The most vital nodes with respect to independent set and vertex cover (Q411833) (← links)
- Polynomial-time recognition of clique-width \(\leq 3\) graphs (Q415285) (← links)
- On switching classes, NLC-width, cliquewidth and treewidth (Q418754) (← links)
- The behavior of clique-width under graph operations and graph transformations (Q519907) (← links)
- Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
- Well-quasi-order of relabel functions (Q603891) (← links)
- On algorithms for (\(P_5\), gem)-free graphs (Q817767) (← links)
- Characterizations for co-graphs defined by restricted NLC-width or clique-width operations (Q819817) (← links)
- Vertex-minors, monadic second-order logic, and a conjecture by Seese (Q858683) (← links)
- A local characterization of bounded clique-width for line graphs (Q868337) (← links)
- Characterizations for restricted graphs of NLC-width 2 (Q870845) (← links)
- Directed NLC-width (Q906393) (← links)
- Recent developments on graphs of bounded clique-width (Q967317) (← links)
- On a disparity between relative cliquewidth and relative NLC-width (Q972344) (← links)
- On the expressive power of permanents and perfect matchings of matrices of bounded pathwidth/cliquewidth (Q987381) (← links)
- Clique-width of graphs defined by one-vertex extensions (Q998353) (← links)
- The NLC-width and clique-width for powers of graphs of bounded tree-width (Q1028448) (← links)
- Graph operations characterizing rank-width (Q1028455) (← links)
- Eigenvalue location in graphs of small clique-width (Q1625480) (← links)
- Inapproximability of rank, clique, Boolean, and maximum induced matching-widths under small set expansion hypothesis (Q1712018) (← links)
- On \textsf{NC} algorithms for problems on bounded rank-width graphs (Q1799577) (← links)
- Edge dominating set and colorings on graphs with fixed clique-width (Q1861574) (← links)
- Constrained-path labellings on graphs of bounded clique-width (Q1959385) (← links)
- Upper bounds to the clique width of graphs (Q1975365) (← links)
- Revising Johnson's table for the 21st century (Q2091799) (← links)
- Classes of graphs with low complexity: the case of classes with bounded linear rankwidth (Q2225428) (← links)
- Comparing linear width parameters for directed graphs (Q2322714) (← links)
- Knocking out \(P_k\)-free graphs (Q2352787) (← links)
- On powers of graphs of bounded NLC-width (clique-width) (Q2383546) (← links)
- Rank-width: algorithmic and structural results (Q2403788) (← links)
- Parameterized complexity of distance labeling and uniform channel assignment problems (Q2413966) (← links)
- Line graphs of bounded clique-width (Q2461201) (← links)
- Approximating clique-width and branch-width (Q2496203) (← links)
- Linear layouts measuring neighbourhoods in graphs (Q2502893) (← links)
- Vertex disjoint paths on clique-width bounded graphs (Q2503296) (← links)
- A model-theoretic characterisation of clique width (Q2503407) (← links)
- The recognizability of sets of graphs is a robust property (Q2566292) (← links)
- On the relationship between NLC-width and linear NLC-width (Q2576869) (← links)
- Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems (Q2817849) (← links)
- Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width (Q2891349) (← links)
- A SAT Approach to Clique-Width (Q2946763) (← links)
- Linear Clique‐Width for Hereditary Classes of Cographs (Q2978187) (← links)
- Digraphs of Bounded Width (Q3120441) (← links)
- On the Expressive Power of Permanents and Perfect Matchings of Matrices of Bounded Pathwidth/Cliquewidth (Extended Abstract) (Q3503637) (← links)
- Graph Operations Characterizing Rank-Width and Balanced Graph Expressions (Q3508555) (← links)
- The Clique-Width of Tree-Power and Leaf-Power Graphs (Q3508556) (← links)
- (Q4625695) (← links)
- (Q5136328) (← links)
