Pages that link to "Item:Q1230637"
From MaRDI portal
The following pages link to Some simplified NP-complete graph problems (Q1230637):
Displayed 50 items.
- A computational study and survey of methods for the single-row facility layout problem (Q354626) (← links)
- Semidefinite relaxations of ordering problems (Q359627) (← links)
- Unbalanced graph partitioning (Q372961) (← links)
- A polyhedral approach to the single row facility layout problem (Q378107) (← links)
- Computing clique and chromatic number of circular-perfect graphs in polynomial time (Q378133) (← links)
- The complexity of the empire colouring problem for linear forests (Q385396) (← links)
- Fast balanced partitioning is hard even on grids and trees (Q388790) (← links)
- Parameterized complexity of max-lifetime target coverage in wireless sensor networks (Q391780) (← links)
- Graph classes with structured neighborhoods and algorithmic applications (Q392023) (← links)
- The complexity of changing colourings with bounded maximum degree (Q407523) (← links)
- Upper bounds on minimum balanced bipartitions (Q409437) (← links)
- A metric for rooted trees with unlabeled vertices based on nested parentheses (Q410711) (← links)
- Computation of lucky number of planar graphs is NP-hard (Q413250) (← links)
- Brooks' theorem for generalized dart graphs (Q413285) (← links)
- 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)
- 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)
- Algorithms for the maximum satisfiability problem (Q753502) (← links)
- Maximizing edge-ratio is NP-complete (Q765326) (← links)
- On optimal linear arrangements of trees (Q789395) (← links)