Pages that link to "Item:Q1230637"
From MaRDI portal
The following pages link to Some simplified NP-complete graph problems (Q1230637):
Displaying 50 items.
- Hardness results for total rainbow connection of graphs (Q274688) (← links)
- Heuristics for the network design problem with connectivity requirements (Q281782) (← links)
- Computing role assignments of split graphs (Q287443) (← links)
- Polynomial algorithms for the maximum stable set problem on particular classes of \(P_{5}\)-free graphs (Q290201) (← links)
- A simplified NP-complete MAXSAT problem (Q293164) (← links)
- On minimum bisection and related partition problems in graphs with bounded tree width (Q322301) (← links)
- Fast heuristics for the frequency channel assignment problem in multi-hop wireless networks (Q322774) (← links)
- Approximating minimum \(k\)-section in trees with linear diameter (Q324723) (← links)
- On the computational complexity of the virtual network embedding problem (Q325446) (← links)
- An extended edge-representative formulation for the \(K\)-partitioning problem (Q325479) (← links)
- Mining approximate interval-based temporal dependencies (Q329410) (← links)
- Polyhedral combinatorics of the \(K\)-partitioning problem with representative variables (Q335322) (← links)
- Branch and bound for the cutwidth minimization problem (Q339558) (← links)
- Relaxed locally identifying coloring of graphs (Q343700) (← links)
- A sufficient condition to extend polynomial results for the maximum independent set problem (Q344869) (← links)
- 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)
- 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)
