Keywords: الگوریتم زمان چندجملهای; Strong triadic closure; Cluster deletion; Cographs; Bounded degree graphs; NP-completeness; Polynomial-time algorithm;
مقالات ISI الگوریتم زمان چندجملهای (ترجمه نشده)
مقالات زیر هنوز به فارسی ترجمه نشده اند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
Keywords: الگوریتم زمان چندجملهای; Computational complexity; Coloring problem; Hereditary class; Polynomial-time algorithm;
Keywords: الگوریتم زمان چندجملهای; OR in airlines; Aircraft Landing Problem; Landing times; Dynamic programming; Polynomial-time algorithm;
Keywords: الگوریتم زمان چندجملهای; Dually chordal graphs; Tree-breadth; 3-colourability; Graph algorithms; Polynomial-time algorithm;
Keywords: الگوریتم زمان چندجملهای; Vertex coloring; Polynomial-time algorithm; Fixed-parameter tractability;
Keywords: الگوریتم زمان چندجملهای; Computational complexity; Coloring problem; Hereditary class; Polynomial-time algorithm;
Keywords: الگوریتم زمان چندجملهای; Independent domination; Polynomial-time algorithm;
Keywords: الگوریتم زمان چندجملهای; Aircraft rerouting; Multiple objective; Polynomial-time algorithm; ε-constraints method; Neighborhood search algorithm;
Keywords: الگوریتم زمان چندجملهای; Polynomial-time algorithm; Longest path problem; Interval graphs; Proper interval vertex deletion set; Data reduction; Fixed-parameter algorithm;
Keywords: الگوریتم زمان چندجملهای; Edge monitoring; interval graphs; complexity; polynomial-time algorithm;
Keywords: الگوریتم زمان چندجملهای; Dominating set problem; Hereditary class; Computational complexity; Polynomial-time algorithm
Keywords: الگوریتم زمان چندجملهای; 05C69; 90C10; 90C27; 90C57; 90C35; 90C39; Dominating set; Cardinality constraint; Tree; Polynomial-time algorithm; Integral polytope;
Keywords: الگوریتم زمان چندجملهای; 3-colorability problem; Computational complexity; Polynomial-time algorithm;
Keywords: الگوریتم زمان چندجملهای; Scheduling; Maintenance; Single machine; Polynomial-time algorithm
Keywords: الگوریتم زمان چندجملهای; Independent set; Polynomial-time algorithm; Subcubic graph; APX-completeness
Keywords: الگوریتم زمان چندجملهای; Vector connectivity; APX-hardness; NP-hardness; Polynomial-time algorithm; Block graphs
Keywords: الگوریتم زمان چندجملهای; Independent domination; Finitely defined class of graphs; Polynomial-time algorithm
Keywords: الگوریتم زمان چندجملهای; Newton polyhedra; Mixed volume; Polynomial equations; Classification; Search for solutions; Polynomial-time algorithm
Keywords: الگوریتم زمان چندجملهای; Graph coloring; Shift coloring; Trees; Polynomial-time algorithm;
Keywords: الگوریتم زمان چندجملهای; Dominating induced matching; Efficient edge dominating set; Polynomial-time algorithm; Clique-width
Keywords: الگوریتم زمان چندجملهای; Confluent flow; Outerplanar graph; Polynomial-time algorithm; Treewidth; FPTAS
Keywords: الگوریتم زمان چندجملهای; Pareto optimal solutions; Convex programming; Multi-linear objective function; Linear programming; Polynomial-time algorithm;
Keywords: الگوریتم زمان چندجملهای; 20B25; 20B40; Cayley object; Cycle base; Automorphism group; Canonical labeling; Polynomial-time algorithm;
Computation of dilated Kronecker coefficients
Keywords: الگوریتم زمان چندجملهای; Representation theory; Kronecker coefficients; Stretching function; Quasi-polynomial; Hilbert series; Residue calculus; Polynomial-time algorithm;
A polynomial-time algorithm for computing low CP-rank decompositions
Keywords: الگوریتم زمان چندجملهای; Completely positive matrix; CP-rank; CP-decomposition; Polynomial-time algorithm; Computational complexity;
Co-Bipartite Neighborhood Edge Elimination Orderings
Keywords: الگوریتم زمان چندجملهای; maximum clique; polynomial-time algorithm; robust algorithm; graph classes; edge ordering;
Efficient domination for classes of P6-free graphs
Keywords: الگوریتم زمان چندجملهای; Efficient domination; P6-free graphs; Chordal graphs; Hole-free graphs; (House, hole, domino)-free graphs; Polynomial-time algorithm;
WQO is decidable for factorial languages
Keywords: الگوریتم زمان چندجملهای; Well-quasi-ordering; Factorial language; Polynomial-time algorithm; Induced subgraph; Permutation;
Polynomial-time algorithms for Subgraph Isomorphism in small graph classes of perfect graphs
Keywords: الگوریتم زمان چندجملهای; Subgraph isomorphism; Graph class; Polynomial-time algorithm; NP-completeness;
Stable matchings of teachers to schools
Keywords: الگوریتم زمان چندجملهای; Stable matchings; Serial dictatorship; NP-completeness; Polynomial-time algorithm; Inapproximability;
A polynomial-time algorithm for sailing speed optimization with containership resource sharing
Keywords: الگوریتم زمان چندجملهای; Bi-section search; Containership; Sailing speed; Bunker fuel; Transit time; Polynomial-time algorithm;
Identification of the anchor points in FDH models
Keywords: الگوریتم زمان چندجملهای; Data Envelopment Analysis (DEA); FDH models; Anchor point; Returns to scale; Polynomial-time algorithm
Coloring clique-hypergraphs of graphs with no subdivision of K5K5
Keywords: الگوریتم زمان چندجملهای; Clique-coloring; K5K5-subdivision-free graph; Clique-hypergraph; Planar graph; Polynomial-time algorithm
Edge-disjoint paths in digraphs with bounded independence number
Keywords: الگوریتم زمان چندجملهای; Disjoint paths; Digraphs; Tournaments; Linking problem; Polynomial-time algorithm; Independence number
NotePriority matchings revisited
Keywords: الگوریتم زمان چندجملهای; C78; D02; C63; Matching; Pairwise kidney exchange problem; Roommate problem; Priority mechanism; Polynomial-time algorithm;
A note on the Cornaz–Jost transformation to solve the graph coloring problem
Keywords: الگوریتم زمان چندجملهای; Graph coloring problem; Graph operators; Max-coloring problem; Polynomial-time algorithm; Computational complexity
Machine scheduling with contiguous processing constraints
Keywords: الگوریتم زمان چندجملهای; Scheduling; Contiguous processing; Feasibility; Optimality; Polynomial-time algorithm
Sparse regular induced subgraphs in 2P32P3-free graphs
Keywords: الگوریتم زمان چندجملهای; Regular graph; Induced subgraph; Polynomial-time algorithm
4-coloring HH-free graphs when HH is small
Keywords: الگوریتم زمان چندجملهای; Graph coloring; Forbidden induced subgraph; Linear forest; Polynomial-time algorithm
Detecting an induced net subdivision
Keywords: الگوریتم زمان چندجملهای; Subdivision; Induced subgraph; Net; Polynomial-time algorithm
Restricted vertex multicut on permutation graphs
Keywords: الگوریتم زمان چندجملهای; Multicut problem; Permutation graphs; Split graphs; Polynomial-time algorithm; NP-completeness
A random fuzzy minimum spanning tree problem through a possibility-based value at risk model
Keywords: الگوریتم زمان چندجملهای; Minimum spanning tree; Random fuzzy variable; Possibility theory; Polynomial-time algorithm; Value-at-risk; Fractile criterion
Edge search number of cographs
Keywords: الگوریتم زمان چندجملهای; Graph searching; NP-hard problem; Polynomial-time algorithm; Graph classes; Cographs
An algorithm for finding a maximum tt-matching excluding complete partite subgraphs
Keywords: الگوریتم زمان چندجملهای; 05C85; 68R10; 90C27bb-matching; Complete partite graph; Polynomial-time algorithm; Shrinking
The x-and-y-axes travelling salesman problem
Keywords: الگوریتم زمان چندجملهای; Combinatorial optimization; Polynomial-time algorithm; Computational complexity; Euclidean travelling salesman problem
Colouring vertices of triangle-free graphs without forests
Keywords: الگوریتم زمان چندجملهای; Vertex colouring; Triangle-free graphs; Polynomial-time algorithm; Clique-width
Polynomial-time recognition of clique-width ≤3 graphs
Keywords: الگوریتم زمان چندجملهای; Clique-width computation; Polynomial-time algorithm
On the complexity of the dominating induced matching problem in hereditary classes of graphs
Keywords: الگوریتم زمان چندجملهای; Dominating induced matching; Efficient edge dominating set; Polynomial-time algorithm
A unified approach for scheduling with convex resource consumption functions using positional penalties
Keywords: الگوریتم زمان چندجملهای; Single machine scheduling; Controllable processing times; Resource allocation; Due date assignment; Positional penalties; Polynomial-time algorithm
Popular matchings in the weighted capacitated house allocation problem
Keywords: الگوریتم زمان چندجملهای; Popular matching problem; Priorities; Strict preference lists; Maximum popular matching; Polynomial-time algorithm