Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity
From MaRDI portal
Recommendations
- Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity
- Degree-constrained graph orientation: maximum satisfaction and minimum violation
- Graph orientations optimizing the number of light or heavy vertices
- Degree-constrained graph orientation: maximum satisfaction and minimum violation
- Graph orientations optimizing the number of light or heavy vertices
Cites work
- scientific article; zbMATH DE number 1696534 (Why is no real title available?)
- A Theorem on Graphs, with an Application to a Problem of Traffic Control
- Acyclic orientations of graphs
- Approximating clique-width and branch-width
- Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree
- Clique-width is NP-complete
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Definability equals recognizability for \(k\)-outerplanar graphs
- Degree-constrained graph orientation: maximum satisfaction and minimum violation
- Easy problems for tree-decomposable graphs
- Exponential time algorithms for the \textsc{minimum dominating set} problem on some graph classes
- Finding a maximum induced degenerate subgraph faster than \(2^{n}\)
- GRAPH ORIENTATION ALGORITHMS TO MINIMIZE THE MAXIMUM OUTDEGREE
- Graph orientations optimizing the number of light or heavy vertices
- Graph-Theoretic Concepts in Computer Science
- Large Induced Subgraphs via Triangulations and CMSO
- Linear time solvable optimization problems on graphs of bounded clique-width
- Listing all potential maximal cliques of a graph
- Minimizing maximum indegree
- Minimum Fill-in on Circle and Circular-Arc Graphs
- On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs
- On finding orientations with the fewest number of vertices with small out-degree
- On the Relationship Between Clique-Width and Treewidth
- On the degrees of the vertices of a directed graph
- Parameterized algorithms
- Parameterized complexity of finding subgraphs with hereditary properties.
- Planar orientations with low out-degree and compaction of adjacency matrices
- Recognizability equals definability for graphs of bounded treewidth and bounded chordality
- Representation of a finite graph by a set of intervals on the real line
- Smallest-last ordering and clustering and graph coloring algorithms
- Strongly connected orientations of mixed multigraphs
- The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
- The monadic second-order logic of graphs. VIII: Orientations
- The parameterized complexity of editing graphs for bounded degeneracy
- Treewidth and Minimum Fill-in on d-Trapezoid Graphs
- Treewidth of Chordal Bipartite Graphs
- Treewidth of cocomparability graphs and a new order-theoretic parameter
- Upper bounds to the clique width of graphs
- Upper degree-constrained partial orientations
- \(k\)-chordal graphs: from cops and robber to compact routing via treewidth
Cited in
(9)- Degree-constrained graph orientation: maximum satisfaction and minimum violation
- Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree
- Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity
- Parameterized orientable deletion
- Graph orientations optimizing the number of light or heavy vertices
- Parameterized orientable deletion
- Graph orientations optimizing the number of light or heavy vertices
- Degree-constrained graph orientation: maximum satisfaction and minimum violation
- Treewidth versus clique number. I: Graph classes with a forbidden structure
This page was built for publication: Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q724225)
