Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity (Q724225): Difference between revisions

@@ Property / Wikidata QID @@
+Q59567349
@@ Property / Wikidata QID: Q59567349 / rank @@
+Normal rank
@@ Property / cites work @@
+Easy problems for tree-decomposable graphs
@@ Property / cites work: Easy problems for tree-decomposable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing maximum indegree
@@ Property / cites work: Minimizing maximum indegree / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Orientations Optimizing the Number of Light or Heavy Vertices
+Normal rank
@@ Property / cites work @@
+Degree-constrained graph orientation: maximum satisfaction and minimum violation
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree
+Normal rank
@@ Property / cites work @@
+GRAPH ORIENTATION ALGORITHMS TO MINIMIZE THE MAXIMUM OUTDEGREE
+Normal rank
@@ Property / cites work @@
+Recognizability equals definability for graphs of bounded treewidth and bounded chordality
+Normal rank
@@ Property / cites work @@
+Treewidth and Minimum Fill-in on d-Trapezoid Graphs
+Normal rank
@@ Property / cites work @@
+Listing all potential maximal cliques of a graph
@@ Property / cites work: Listing all potential maximal cliques of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Planar orientations with low out-degree and compaction of adjacency matrices
+Normal rank
@@ Property / cites work @@
+Strongly connected orientations of mixed multigraphs
+Normal rank
@@ Property / cites work @@
+On the Relationship Between Clique-Width and Treewidth
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. VIII: Orientations
+Normal rank
@@ Property / cites work @@
+Linear time solvable optimization problems on graphs of bounded clique-width
+Normal rank
@@ Property / cites work @@
+Upper bounds to the clique width of graphs
@@ Property / cites work: Upper bounds to the clique width of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Clique-Width is NP-Complete
@@ Property / cites work: Clique-Width is NP-Complete / rank @@
+Normal rank
@@ Property / cites work @@
+Large Induced Subgraphs via Triangulations and CMSO
+Normal rank
@@ Property / cites work @@
+Acyclic orientations of graphs
@@ Property / cites work: Acyclic orientations of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Upper degree-constrained partial orientations
@@ Property / cites work: Upper degree-constrained partial orientations / rank @@
+Normal rank
@@ Property / cites work @@
+Exponential time algorithms for the minimum dominating set problem on some graph classes
+Normal rank
@@ Property / cites work @@
+Q2766682
@@ Property / cites work: Q2766682 / rank @@
+Normal rank
@@ Property / cites work @@
+Treewidth of cocomparability graphs and a new order-theoretic parameter
+Normal rank
@@ Property / cites work @@
+On the degrees of the vertices of a directed graph
+Normal rank
@@ Property / cites work @@
+Definability Equals Recognizability for $k$-Outerplanar Graphs
+Normal rank
@@ Property / cites work @@
+On finding orientations with the fewest number of vertices with small out-degree
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of finding subgraphs with hereditary properties.
+Normal rank
@@ Property / cites work @@
+Treewidth of Chordal Bipartite Graphs
@@ Property / cites work: Treewidth of Chordal Bipartite Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum Fill-in on Circle and Circular-Arc Graphs
@@ Property / cites work: Minimum Fill-in on Circle and Circular-Arc Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+\(k\)-chordal graphs: from cops and robber to compact routing via treewidth
+Normal rank
@@ Property / cites work @@
+Representation of a finite graph by a set of intervals on the real line
+Normal rank
@@ Property / cites work @@
+The parameterized complexity of editing graphs for bounded degeneracy
+Normal rank
@@ Property / cites work @@
+Smallest-last ordering and clustering and graph coloring algorithms
+Normal rank
@@ Property / cites work @@
+On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs
+Normal rank
@@ Property / cites work @@
+Graph-Theoretic Concepts in Computer Science
@@ Property / cites work: Graph-Theoretic Concepts in Computer Science / rank @@
+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 @@
+Finding a Maximum Induced Degenerate Subgraph Faster Than 2 n
+Normal rank
@@ Property / cites work @@
+A Theorem on Graphs, with an Application to a Problem of Traffic Control
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Polyhedra and efficiency (3 volumes)
+Normal rank