Pages that link to "Item:Q1230637"
From MaRDI portal
The following pages link to Some simplified NP-complete graph problems (Q1230637):
Displaying 50 items.
- On the complexity of computing the \(k\)-restricted edge-connectivity of a graph (Q501666) (← links)
- Improved approximation algorithms for projection games (Q513283) (← links)
- Mixed-integer quadratic programming is in NP (Q517303) (← links)
- Graph cuts with interacting edge weights: examples, approximations, and algorithms (Q517305) (← links)
- The robust binomial approach to chance-constrained optimization problems with application to stochastic partitioning of large process networks (Q518934) (← links)
- WORM colorings of planar graphs (Q521753) (← links)
- MSOL restricted contractibility to planar graphs (Q527397) (← links)
- Algorithms for \(k\)-internal out-branching and \(k\)-tree in bounded degree graphs (Q527430) (← links)
- Optimization problems in multiple subtree graphs (Q531599) (← links)
- The algorithmic complexity of mixed domination in graphs (Q533883) (← links)
- Efficient branch-and-bound algorithms for weighted MAX-2-SAT (Q535012) (← links)
- Computing compatible tours for the symmetric traveling salesman problem (Q542055) (← links)
- Maximum information stored in a labeled connected network with minimum edges (Q548186) (← links)
- Recolouring-resistant colourings (Q548277) (← links)
- Crossing numbers of graphs with rotation systems (Q548653) (← links)
- Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
- The complexity of finding two disjoint paths with min-max objective function (Q584275) (← links)
- New spectral lower bounds on the bisection width of graphs (Q596083) (← links)
- Partitions of graphs into cographs (Q607000) (← links)
- Lower bounds on the independence number of certain graphs of odd girth at least seven (Q617649) (← links)
- Iterative denoising (Q626230) (← links)
- A study of 3-arc graphs (Q628319) (← links)
- Solving MAX-\(r\)-SAT above a tight lower bound (Q644808) (← links)
- Expressive markets for donating to charities (Q646531) (← links)
- Almost tight upper bound for finding Fourier coefficients of bounded pseudo-Boolean functions (Q657913) (← links)
- Computing solutions for matching games (Q662281) (← links)
- Exponential lower bounds for the tree-like Hajós calculus (Q673010) (← links)
- A linear-time algorithm for computing the intersection of all odd cycles in a graph (Q674917) (← links)
- Finite-model theory -- A personal perspective (Q688663) (← links)
- Parameterized complexity in multiple-interval graphs: domination, partition, separation, irredundancy (Q690460) (← links)
- Maximum regular induced subgraphs in \(2P_3\)-free graphs (Q690473) (← links)
- A note on exact algorithms for vertex ordering problems on graphs (Q692902) (← links)
- Orthogonal segment stabbing (Q705557) (← links)
- Bounded-depth succinct encodings and the structure they imply on graphs (Q722204) (← links)
- Upper domination: towards a dichotomy through boundary properties (Q722525) (← links)
- Planar graphs without adjacent cycles of length at most five are \((1,1,0)\)-colorable (Q738860) (← links)
- Approximating the partition function of planar two-state spin systems (Q743131) (← links)
- Base-object location problems for base-monotone regions (Q744059) (← links)
- On the extension complexity of combinatorial polytopes (Q745682) (← links)
- An exact combinatorial algorithm for minimum graph bisection (Q747771) (← links)
- A bounded-error quantum polynomial-time algorithm for two graph bisection problems (Q747789) (← links)
- Algorithms for the maximum satisfiability problem (Q753502) (← links)
- Maximizing edge-ratio is NP-complete (Q765326) (← links)
- Convergence and hardness of strategic Schelling segregation (Q776259) (← links)
- Complexity of planar signed graph homomorphisms to cycles (Q777377) (← links)
- Connected greedy coloring of \(H\)-free graphs (Q777440) (← links)
- On theoretical and empirical algorithmic analysis of the efficiency gap measure in partisan gerrymandering (Q782765) (← links)
- Chromatic numbers of simplicial manifolds (Q784756) (← links)
- On optimal linear arrangements of trees (Q789395) (← links)
- On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems (Q791320) (← links)
