Pages that link to "Item:Q2768335"
From MaRDI portal
The following pages link to Polynomial algorithms for partitioning problems on graphs with fixed clique-width (extended abstract) (Q2768335):
Displaying 16 items.
- MSOL partitioning problems on graphs of bounded treewidth and clique-width (Q884481) (← links)
- Polynomial algorithms for the weighted perfect domination problems on chordal graphs and split graphs (Q1313745) (← links)
- Edge dominating set and colorings on graphs with fixed clique-width (Q1861574) (← links)
- Algorithms for vertex-partitioning problems on graphs with fixed clique-width. (Q1874418) (← links)
- Efficient computation of the oriented chromatic number of recursively defined digraphs (Q2235732) (← links)
- Polynomial-time approximation scheme for a problem of partitioning a finite set into two clusters (Q2396371) (← links)
- Parameterized complexity of distance labeling and uniform channel assignment problems (Q2413966) (← links)
- Faster algorithms for vertex partitioning problems parameterized by clique-width (Q2447760) (← links)
- Improved bottleneck domination algorithms (Q2499580) (← links)
- Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems (Q2817849) (← links)
- Graph Classes with Structured Neighborhoods and Algorithmic Applications (Q3104764) (← links)
- Computing Graph Polynomials on Graphs of Bounded Clique-Width (Q3522957) (← links)
- (Q4448752) (← links)
- (Q4608071) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5902536) (← links)
- (Q6068263) (← links)
