Graph classes with structured neighborhoods and algorithmic applications (Q392023): Difference between revisions

@@ Property / DOI @@
-.1016/j.tcs.2013.01.011
@@ Property / DOI: 10.1016/j.tcs.2013.01.011 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2013.01.011
+Normal rank
@@ Property / OpenAlex ID @@
+W1964095725
@@ Property / OpenAlex ID: W1964095725 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems
+Normal rank
@@ Property / cites work @@
+Algorithms for Vertex Partitioning Problems on Partial k-Trees
+Normal rank
@@ Property / cites work @@
+Linear time solvable optimization problems on graphs of bounded clique-width
+Normal rank
@@ Property / cites work @@
+Some simplified NP-complete graph problems
@@ Property / cites work: Some simplified NP-complete graph problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q3694712
@@ Property / cites work: Q3694712 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs
+Normal rank
@@ Property / cites work @@
+Domination in convex and chordal bipartite graphs
@@ Property / cites work: Domination in convex and chordal bipartite graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4427278
@@ Property / cites work: Q4427278 / rank @@
+Normal rank
@@ Property / cites work @@
+Independence and domination in polygon graphs
@@ Property / cites work: Independence and domination in polygon graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Domination in permutation graphs
@@ Property / cites work: Domination in permutation graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Computing role assignments of chordal graphs
@@ Property / cites work: Computing role assignments of chordal graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Linear time algorithms on circular-arc graphs
@@ Property / cites work: Linear time algorithms on circular-arc graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Dominations in trapezoid graphs
@@ Property / cites work: Dominations in trapezoid graphs / rank @@
+Normal rank
@@ Property / cites work @@
+An $O(N + M)$-Time Algorithm for Finding a Minimum-Weight Dominating Set in a Permutation Graph
+Normal rank
@@ Property / cites work @@
+Fast algorithms for the dominating set problem on permutation graphs
+Normal rank
@@ Property / cites work @@
+Q4847026
@@ Property / cites work: Q4847026 / rank @@
+Normal rank
@@ Property / cites work @@
+Boolean-width of graphs
@@ Property / cites work: Boolean-width of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Node-Deletion Problems on Bipartite Graphs
@@ Property / cites work: Node-Deletion Problems on Bipartite Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Decomposition of perfect graphs
@@ Property / cites work: Decomposition of perfect graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Branch-width and well-quasi-ordering in matroids and graphs.
+Normal rank
@@ Property / cites work @@
+Approximating clique-width and branch-width
@@ Property / cites work: Approximating clique-width and branch-width / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. X: Obstructions to tree-decomposition
+Normal rank
@@ Property / cites work @@
+Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
+Normal rank
@@ Property / cites work @@
+Linear-time recognition of circular-arc graphs
@@ Property / cites work: Linear-time recognition of circular-arc graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4471290
@@ Property / cites work: Q4471290 / rank @@
+Normal rank
@@ Property / cites work @@
+A linear time algorithm to recognize circular permutation graphs
+Normal rank
@@ Property / cites work @@
+On the 2-Chain Subgraph Cover and Related Problems
+Normal rank
@@ Property / cites work @@
+Treewidth and Minimum Fill-in on d-Trapezoid Graphs
+Normal rank
@@ Property / cites work @@
+The Complexity of the Partial Order Dimension Problem
+Normal rank
@@ Property / cites work @@
+The Hardness of Approximating Poset Dimension
@@ Property / cites work: The Hardness of Approximating Poset Dimension / rank @@
+Normal rank
@@ Property / cites work @@
+Measuring the vulnerability for classes of intersection graphs
+Normal rank
@@ Property / cites work @@
+Polygon Graph Recognition
@@ Property / cites work: Polygon Graph Recognition / rank @@
+Normal rank
@@ Property / cites work @@
+Recognition algorithms for orders of small width and graphs of small Dilworth number
+Normal rank
@@ Property / cites work @@
+The Rank-Width of the Square Grid
@@ Property / cites work: The Rank-Width of the Square Grid / rank @@
+Normal rank
@@ Property / cites work @@
+Clustering and domination in perfect graphs
@@ Property / cites work: Clustering and domination in perfect graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Weighted domination of cocomparability graphs
@@ Property / cites work: Weighted domination of cocomparability graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of domination problems in circle graphs
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2013.01.011
@@ Property / DOI: 10.1016/J.TCS.2013.01.011 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:392023