Pages that link to "Item:Q1230637"
From MaRDI portal
The following pages link to Some simplified NP-complete graph problems (Q1230637):
Displayed 50 items.
- An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach (Q414633) (← links)
- Graphs of separability at most 2 (Q415268) (← links)
- Optimizing \(K^2\) trees: a case for validating the maturity of network of practices (Q418346) (← links)
- Autonomous sets for the hypergraph of all canonical covers (Q429444) (← links)
- A new discrete filled function method for solving large scale max-cut problems (Q438797) (← links)
- Complexity results for the gap inequalities for the max-cut problem (Q439900) (← links)
- Online maximum \(k\)-coverage (Q442204) (← links)
- Robust optimization of graph partitioning involving interval uncertainty (Q443713) (← links)
- Graph clustering (Q458448) (← links)
- Regular inference as vertex coloring (Q465248) (← links)
- NP-hardness of the Euclidean Max-Cut problem (Q471386) (← links)
- Coloring graphs characterized by a forbidden subgraph (Q476308) (← links)
- Approximation algorithms for intersection graphs (Q476425) (← links)
- The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbones (Q477637) (← links)
- Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem (Q489116) (← links)
- Gaming is a hard job, but someone has to do it! (Q489749) (← links)
- Evader interdiction: algorithms, complexity and collateral damage (Q490228) (← links)
- On the parameterized complexity of computing balanced partitions in graphs (Q493645) (← links)
- Reconstruction and estimation in the planted partition model (Q495549) (← links)
- A GRASP metaheuristic for the robust mapping and routing of dataflow process networks on manycore architectures (Q496107) (← links)
- Distance constraints on short cycles for 3-colorability of planar graphs (Q497344) (← links)
- 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)