Pages that link to "Item:Q1230637"
From MaRDI portal
The following pages link to Some simplified NP-complete graph problems (Q1230637):
Displayed 50 items.
- Boolesche Minimalpolynome und Überdeckungsprobleme (Q1224047) (← links)
- Consistency in networks of relations (Q1231783) (← links)
- One more polynomial complete consecutive retrieval problem (Q1241287) (← links)
- The densest hemisphere problem (Q1242681) (← links)
- On the complexity of some two-person perfect-information games (Q1248466) (← links)
- An intermediate-value theorem for optimum tree valuation (Q1253929) (← links)
- The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two (Q1254855) (← links)
- On the communication complexity of zero-knowledge proofs (Q1261016) (← links)
- The use of dynamic programming in genetic algorithms for permutation problems (Q1268271) (← links)
- A unified approximation algorithm for node-deletion problems (Q1270821) (← links)
- A characterization of signed hypergraphs and its applications to VLSI via minimization and logic synthesis (Q1276973) (← links)
- The complexity of some problems related to GRAPH 3-COLORABILITY (Q1281385) (← links)
- On the algorithmic complexity of twelve covering and independence parameters of graphs (Q1283793) (← links)
- Optimal cutting directions and rectangle orientation algorithm (Q1303735) (← links)
- The line index and minimum cut of weighted graphs (Q1303736) (← links)
- Stable sets in certain \(P_6\)-free graphs (Q1304476) (← links)
- Maximum cut on line and total graphs (Q1304481) (← links)
- The partial constraint satisfaction problem: Facets and lifting theorems (Q1306379) (← links)
- The domatic number problem on some perfect graph families (Q1313715) (← links)
- The computational complexity of knot and matroid polynomials (Q1313843) (← links)
- Finding the lowest free energy conformation of a protein is an NP-hard problem: Proof and implications (Q1319879) (← links)
- Optimal scheduling in film production to minimize talent hold cost (Q1321428) (← links)
- Algorithmic complexity of list colorings (Q1327214) (← links)
- A graph approximation heuristic for the vertex cover problem on planar graphs (Q1328583) (← links)
- Call routing and the ratcatcher (Q1330799) (← links)
- The hardness of approximation: Gap location (Q1332662) (← links)
- On problems with short certificates (Q1338895) (← links)
- New heuristic solution procedures for the uniform graph partitioning problem: Extensions and evaluation (Q1342107) (← links)
- A genetic algorithm for the talent scheduling problem (Q1342111) (← links)
- On approximation algorithms for the minimum satisfiability problem (Q1351157) (← links)
- On piecewise quadratic Newton and trust region problems (Q1356055) (← links)
- A linear programming approach to reasoning about probabilities (Q1356219) (← links)
- \(k\)-edge subgraph problems (Q1356515) (← links)
- A nice class for the vertex packing problem (Q1363736) (← links)
- Variable and term removal from Boolean formulae (Q1363769) (← links)
- Triangulating planar graphs while minimizing the maximum degree (Q1363779) (← links)
- On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees (Q1367169) (← links)
- The Metropolis algorithm for graph bisection (Q1383365) (← links)
- A sufficient condition for planar graphs to be 3-colorable (Q1405097) (← links)
- Spectral methods for graph bisection problems. (Q1406654) (← links)
- Subcolorings and the subchromatic number of a graph (Q1412662) (← links)
- An augmenting graph approach to the stable set problem in \(P_{5}\)-free graphs (Q1414237) (← links)
- \(P_{5}\)-free augmenting graphs and the maximum stable set problem (Q1414587) (← links)
- Cardinality constrained minimum cut problems: complexity and algorithms. (Q1427809) (← links)
- The closure of monadic NP (Q1577017) (← links)
- Algorithms for graph partitioning problems by means of eigenspace relaxations (Q1577115) (← links)
- The NP-completeness of (1,r)-subcolorability of cubic graphs (Q1603517) (← links)
- Superposition and constructions of graphs without nowhere-zero \(k\)-flows (Q1612758) (← links)
- Complexity of finding dense subgraphs (Q1613384) (← links)
- On the complexity of barrier resilience for fat regions and bounded ply (Q1615674) (← links)