Keywords: تکمیل NP; Induced subgraph; Chromatic number; Clique number; Forbidden induced subgraph; NP-completeness; Perfect graph;
مقالات ISI تکمیل NP (ترجمه نشده)
مقالات زیر هنوز به فارسی ترجمه نشده اند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
Keywords: تکمیل NP; Strong triadic closure; Cluster deletion; Cographs; Bounded degree graphs; NP-completeness; Polynomial-time algorithm;
Keywords: تکمیل NP; Computational complexity; NP-completeness; Fixed-parameter algorithm; Token swapping; Colored token swapping;
Keywords: تکمیل NP; Graph theory; Independent dominating set; Dominating set; Conflicts; Forbidden pairs; NP-completeness;
Keywords: تکمیل NP; Computational social choice; Voting; Manipulation; Elicitation; Incomplete election; Algorithm; NP-completeness;
Keywords: تکمیل NP; Approximation; Relation; Partial order; NP-completeness; Rough Sets;
Keywords: تکمیل NP; 00-01; 99-00; Deterministic mechanism design; NP-completeness; Complexity theory; Algorithms;
Keywords: تکمیل NP; Networks; Betweenness centrality; Clique; NP-completeness; Combinatorial branch-and-bound;
Keywords: تکمیل NP; Feedback arc set; Acyclic disconnection; Oriented planar graphs; np-completeness;
Keywords: تکمیل NP; Graph coloring; NP-completeness;
Keywords: تکمیل NP; Approximation algorithms; Minimum spanning cactus; NP-Completeness; Minimum spanning tree;
Keywords: تکمیل NP; Rectangle escape; Approximation algorithms; Randomized rounding; NP-completeness; Inapproximability;
Keywords: تکمیل NP; Broadcast; Single-hop; Multi-rate; Multi-interface; Monge property; Dynamic programming; NP-completeness;
Keywords: تکمیل NP; Line graph; Independence number; Matching number; Min-max theorems; NP-completeness; Approximation hardness;
Keywords: تکمیل NP; Partner Units Problem; Computational complexity; NP-completeness;
Keywords: تکمیل NP; Metric dimension; Planar graph; Outerplanar graph; NP-completeness;
Keywords: تکمیل NP; Ad-hoc networks; Obstructed wireless networks; Connectivity; Backbone; NP-completeness; Approximation algorithms;
Keywords: تکمیل NP; Graph theory; Complexity; Complexity classes; Polynomial hierarchy; NP-completeness; Hardness; Identifying codes; Twin-free graphs
Keywords: تکمیل NP; Partner units problem; Computational complexity; NP-completeness;
Keywords: تکمیل NP; Simplicial complexes; Hypergraphs; Tree representations; NP-completeness; APX-completeness; Approximation algorithms;
Keywords: تکمیل NP; CSP; Constraint satisfaction; Domain reduction; Tractable class; Hybrid tractability; NP-completeness; Global constraints;
Keywords: تکمیل NP; Monophonic convexity; Bipartite graphs; NP-completeness; Inapproximability; Convexity number; Percolation time
Keywords: تکمیل NP; Approximation algorithms; Weighted Rule Ensemble Classification Reversal problem; Feasibility; NP-completeness; Approximation; Inapproximability
Keywords: تکمیل NP; Spanning cactus; NP-completeness; Approximation algorithms; τ-Triangle inequality; Minimum spanning tree
Keywords: تکمیل NP; Algorithms; Pure equilibria; Congestion games on parallel links; NP-completeness
Keywords: تکمیل NP; Large-scale control systems design; NP-completeness; Structural controllability; Multi-agent networked control
Keywords: تکمیل NP; Complexity; Graph theory; NP-completeness; Quantum information
Keywords: تکمیل NP; Sensor network; Mobile sensors; Barrier coverage; Algorithmic complexity; NP-completeness
Keywords: تکمیل NP; Graph algorithms; NP-completeness; APX-completeness; Approximation algorithms; Domination; Liar's domination; Chordal graph
Keywords: تکمیل NP; String partitioning; Equality-free; Prefix-free; Suffix-free; Factor-free; NP-completeness; Collision-aware oligo design; Gene synthesis
Keywords: تکمیل NP; Test cover; Separating system; Identifying code; Locating-dominating set; NP-completeness; Approximation
Keywords: تکمیل NP; Rainbow matching; Computational complexity; NP-completeness; APX-completeness; Parameterized complexity;
Keywords: تکمیل NP; Complexity; NP-completeness; NP-hardness; Domination; Bondage; Total bondage; Reinforcement; Total reinforcement
Keywords: تکمیل NP; 91A12; 91A06; 68Q25Matching; Pareto optimality; Serial dictatorship; NP-completeness
Keywords: تکمیل NP; Decision-theoretic troubleshooting; Hardness of approximation; NP-completeness; Min-sum set cover; Decision tree
Keywords: تکمیل NP; Data broadcasting; Latency; Multiple channels; DAGs; NP-Completeness
Keywords: تکمیل NP; Square-orthogonal drawing; Bend number; Non-planar drawing; NP-completeness
Keywords: تکمیل NP; Network interdiction; Mixed-Integer Linear Programming; NP-completeness; Branch-and-Price; Cuts;
Keywords: تکمیل NP; 03D15; 20F65; 20F10; 20F16; Polycyclic groups; Nilpotent groups; Subset sum problem; NP-completeness;
Keywords: تکمیل NP; Interval number; Track number; NP-completeness; Planar graphs
Keywords: تکمیل NP; Petri nets; Deadlock; Resource allocation systems; Collaboration; PSPACE-completeness; NP-completeness
Keywords: تکمیل NP; Edge intersection graphs; Grid paths; Split graphs; NP-completeness; Recognition algorithms; L-graphs
Keywords: تکمیل NP; Parameterised pattern matching; Function matching; NP-completeness; Membership problem for pattern languages; Morphisms
A 2k-kernelization algorithm for vertex cover based on crown decomposition
Keywords: تکمیل NP; Vertex cover; Crown decomposition; Kernelization; FPT algorithms; NP-completeness;
Recognizing Union-Find trees is NP-complete
Keywords: تکمیل NP; Union-Find trees; Complexity; NP-completeness; Data structures; Union-by-size;
Completion of partial Latin Hypercube Designs: NP-completeness and inapproximability
Keywords: تکمیل NP; Latin hypercube design; Maximin design; NP-completeness; Inapproximability;
On a generalized Levinthal's paradox: The role of long- and short range interactions in complex bio-molecular reactions, including protein and DNA folding
Keywords: تکمیل NP; Levinthal's paradox; Protein folding and misfolding; Molecular docking; NP-Completeness; Long-range interactions; Drug design;
Correspondence Homomorphisms to Reflexive Graphs
Keywords: تکمیل NP; Homomorphism; dichotomy; NP-completeness;
Restrained Domination in Some Subclasses of Chordal Graphs
Keywords: تکمیل NP; Domination; Restrained domination; NP-completeness; Chordal graphs; Doubly chordal graphs; Block graphs;
IV-matching is strongly NP-hard
Keywords: تکمیل NP; Combinatorial problems; Computational complexity; Graph matching; Graph algorithms; NP-completeness;