Keywords: NP کامل است; 2-partition; Maximum out-degree reducing partition; NP-complete; Polynomial algorithm;
مقالات ISI NP کامل است (ترجمه نشده)
مقالات زیر هنوز به فارسی ترجمه نشده اند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
Keywords: NP کامل است; Conflict-free coloring; Parameterized complexity; NP-complete;
Keywords: NP کامل است; Semicomplete digraph; Tournament; 2-partition; Minimum semi-degree; Minimum out-degree; Minimum in-degree; NP-complete; Digraphs of bounded independence number;
Keywords: NP کامل است; Distance-preserving elimination ordering; Metric graph theory; NP-complete; Exact exponential algorithm; Integer linear programming; Bounded treewidth;
Keywords: NP کامل است; Secure dominating set; split graph; NP-complete; total domination;
Keywords: NP کامل است; Graph burning; Computational complexity; NP-complete; 3-partition; Polynomial time algorithm; Approximation algorithm;
Keywords: NP کامل است; Connected zero forcing; Zero forcing; NP-complete; Unicyclic graph; Cactus graph; Block graph;
Keywords: NP کامل است; ABC; Artificial bee colony; AT; Automatic transmission; ANN; Artificial neural network; AWD; All wheel drive; BEV; Battery electric vehicle; CAFC; Corporate average fuel consumption; CAFE; Corporate average fuel economy; CVT; Continuous variable transmiss
Keywords: NP کامل است; Domination; Chordal graph; Graph algorithm; Approximation algorithm; NP-complete; APX-complete;
Keywords: NP کامل است; primary; 20M99; secondary; 68Q25; Idempotent semigroups; Subalgebras of powers; Membership test; Computational complexity; NP-complete; Quasivariety;
Keywords: NP کامل است; Oriented coloring; Maximum degree 3 graph; Planar graph; Bipartite graph; NP-complete;
Keywords: NP کامل است; Linkage; NP-complete; Optimization problem; Rigid origami;
Keywords: NP کامل است; Approximation algorithm; Active range optimization; Dynamic map labeling; NP-complete
Keywords: NP کامل است; Sudoku; NP-complete; Reduction; Hamiltonian cycle problem;
Keywords: NP کامل است; Wireless sensor network; Data aggregation; NP-complete
Keywords: NP کامل است; Minimum feedback arc set; Node ordering; Information system; Monte Carlo; Randomization; NP-hard; NP-complete; APX-hard
Keywords: NP کامل است; Domination; Total outer-connected domination; Graph algorithms; Chordal graph; NP-complete; APX-complete;
Keywords: NP کامل است; Geometric set cover; Geometric hitting set; Generalized class cover; Half-strips; Opposite directions; NP-complete;
Keywords: NP کامل است; Algorithms; Depth first search; Unique paths; Directed graphs; Connectivity; NP-complete
Keywords: NP کامل است; Combinatorial problems; Connectivity; Tree-coritivity; Tree-core; NP-complete
Keywords: NP کامل است; Triangles; Graphs; NP-complete; Approximation algorithm
Keywords: NP کامل است; (Strong) rainbow connection; Rainbow vertex-connection; Bipartite graph; NP-Complete; Polynomial-time
Keywords: NP کامل است; Conflict-free coloring; NP-complete; Parametrized algorithm
Keywords: NP کامل است; Cycle factor; 2-factor; Mixed problem; NP-complete; Complexity; Cycle factors with no short cycles; Latin square; Avoidable arrays; Monochromatic matchings
Keywords: NP کامل است; NP-complete; FPT-algorithm; Independent dominating set; Dominating set; Weighted independent dominating set; Cubic bipartite graph; At-most-cubic grid graph; (k,ℓ)(k,ℓ)-graph
Keywords: NP کامل است; Complexity theory; Project scheduling; Secret project; NP-complete; Polynomial algorithm
Keywords: NP کامل است; Multicut; Mixed graphs; Mixed problem; Dichotomy; NP-complete; Feedback arc set
Keywords: NP کامل است; Capacity factor; Capacity rank; Multicast network; Network coding; NP-complete
Keywords: NP کامل است; Graph pebbling; Planar; Outerplanar; NP-complete
Keywords: NP کامل است; Backbone colouring; Planar graph; Tree backbone; NP-complete
Keywords: NP کامل است; Combinatorial problems; Multiprocessor scheduling; Particle swarm optimization; NP-complete; Parallel processing; Graph theory;
Keywords: NP کامل است; Cubic graphs; Equitable total-coloring; NP-complete
Keywords: NP کامل است; Disjoint branchings; Branching flow; Polynomial algorithm; NP-complete
Keywords: NP کامل است; Directional antenna; Connected network; NP-complete; Stretch factor
NP-completeness of local colorings of graphs
Keywords: NP کامل است; Local k-coloring; Local chromatic number; Planar graph; NP-complete; Computational complexity;
On NC algorithms for problems on bounded rank-width graphs
Keywords: NP کامل است; Rank-width; NP-complete; Parallel algorithms; Clique-width;
Hardness result for the total rainbow k-connection of graphs
Keywords: NP کامل است; Total-rainbow k-connection number; Computational complexity; NP-complete; 05C15; 05C40; 68Q17; 68Q25; 68R10;
On the (di)graphs with (directed) proper connection number two
Keywords: NP کامل است; proper connection; digraphs; bipartite; even dicycles; NP-complete;
The real nonnegative inverse eigenvalue problem is NP-hard
Keywords: NP کامل است; 15A18; 15A29; 90C60; 68Q25; Nonnegative matrix; Inverse eigenvalue problem; Decision problem; P; NP; NP-hard; NP-complete;
Small polyomino packing
Keywords: NP کامل است; Computational complexity; Computational geometry; Polyomino packing; NP-complete; Strongly NP-complete;
α-Concave hull, a generalization of convex hull
Keywords: NP کامل است; Convex hull; α-Shape; α-Concave hull; Minimum area polygon; NP-complete; Approximation algorithm;
Complexity of coloring graphs without paths and cycles
Keywords: NP کامل است; Coloring; Certifying algorithms; Paths and cycles; NP-complete; Obstructions;
A linear-time algorithm for finding Hamiltonian (s,t)-paths in even-sized rectangular grid graphs with a rectangular hole
Keywords: NP کامل است; Grid graph; Hamiltonian path; Hamiltonian cycle; Rectangular grid graphs with a rectangular hole; NP-complete;
Hardness of peeling with stashes
Keywords: NP کامل است; NP-complete; Graph algorithms; Peeling process; Stash; Hashing
Finding good 2-partitions of digraphs I. Hereditary properties
Keywords: NP کامل است; Oriented; NP-complete; Polynomial; Partition; Splitting digraphs; Acyclic; Semicomplete digraph; Tournament; Out-branching; Feedback vertex set; 2-partition; Minimum degree
The VC-dimension of graphs with respect to k-connected subgraphs
Keywords: NP کامل است; VC-dimension; k-connected; NP-complete;
Joint scheduling of MapReduce jobs with servers: Performance bounds and experiments
Keywords: NP کامل است; MapReduce; Scheduling; Server assignment; NP-complete; Fast heuristic;
Finding good 2-partitions of digraphs II. Enumerable properties
Keywords: NP کامل است; Oriented; NP-complete; Polynomial; Partition; Splitting digraphs; Acyclic; Semicomplete digraph; Tournament; Out-branching; Feedback vertex set; 2-Partition; Minimum degree
Hamiltonian paths in L-shaped grid graphs
Keywords: NP کامل است; Grid graph; Hamiltonian path; L-shaped grid graph; NP-complete
Stable-ΠΠ partitions of graphs
Keywords: NP کامل است; Stable-ΠΠ partition; Hereditary property; Speed of graph property; Factorial property; Polynomial-time; NP-complete