Keywords: تطبیق القایی; Transversals; Maximal independent set; Clutter; Clutter minor; Induced matching; Blocker; k-SAT; Set cover;
مقالات ISI تطبیق القایی (ترجمه نشده)
مقالات زیر هنوز به فارسی ترجمه نشده اند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
Keywords: تطبیق القایی; Matching; Edge coloring; Induced matching; Acyclic matching; Uniquely restricted matching;
Keywords: تطبیق القایی; Induced matching; Dominating induced matching; Spectral graph theory;
Keywords: تطبیق القایی; Induced matching; Well-covered graph; Optimization problem; Computational complexity; Forbidden induced subgraph;
Keywords: تطبیق القایی; Node-deletion problem; Independent Set; Dissociative Set; Vertex kk-Path Cover; Feedback Vertex Cover; Induced matching; kk-regular induced subgraph; Augmenting graph
Keywords: تطبیق القایی; Independent set; Packing; Matching; Induced matching
Keywords: تطبیق القایی; Induced matching; Greedy algorithm; Approximation algorithm; Strong chromatic index; Degenerate graph
Keywords: تطبیق القایی; Induced matching; Strong matching; Fixed parameter tractability
Keywords: تطبیق القایی; Strong chromatic index; Induced matching; Tree-cograph; Permutation graph; Chordal bipartite graph
Keywords: تطبیق القایی; Induced matching; Strong matching; Strong chromatic index
Locally searching for large induced matchings
Keywords: تطبیق القایی; Induced matching; Strong matching; Local search;
Characterization of the induced matching extendable graphs with 2n vertices and 3n edges
Keywords: تطبیق القایی; Matching; Perfect matching; Induced matching; Induced matching extendable;
The strong chromatic index of (3,Î)-bipartite graphs
Keywords: تطبیق القایی; Bipartite graph; Strong edge-coloring; Induced matching;
Induced 2-regular subgraphs in kk-chordal cubic graphs
Keywords: تطبیق القایی; Induced regular subgraph; Induced cycle; Independent set; Induced matching
Strong edge-colouring and induced matchings
Keywords: تطبیق القایی; Strong edge-colouring; Induced matching; Computational complexity; Planar graphs; Outerplanar graphs
Maximum induced matching problem on hhd-free graphs
Keywords: تطبیق القایی; Graph; Algorithm; Induced matching; Chordal; hhd-free
Brambles and independent packings in chordal graphs
Keywords: تطبیق القایی; Independent packing; Induced matching; Bramble; Chordal graph; Min–max theorem; Independent set; Clique
Edge-deletable IM-extendable graphs with minimum number of edges
Keywords: تطبیق القایی; Induced matching; IM-extendable; kk-edge-deletable IM-extendable graphs
The parameterized complexity of the induced matching problem
Keywords: تطبیق القایی; Induced matching; Parameterized complexity; Planar graph; Kernelization; Tree decomposition
The strong chromatic index of a class of graphs
Keywords: تطبیق القایی; Strong edge coloring; Strong chromatic index; Induced matching; Line graph
Approximability results for the maximum and minimum maximal induced matching problems
Keywords: تطبیق القایی; 68W25; 68Q17; 05C69; 05C70Combinatorial optimization; Induced matching; Bipartite graph; Approximability; NP-completeness
Generalizing the induced matching by edge capacity constraints
Keywords: تطبیق القایی; Approximation algorithm; Induced matching; Edge capacity; Polytopes
The graphs with maximum induced matching and maximum matching the same size
Keywords: تطبیق القایی; Matching; Induced matching; Perfect graph; Optimization problems; Matroid;
4-regular claw-free IM-extendable graphs
Keywords: تطبیق القایی; 05C70; 05C35; Induced matching; IM-extendable; Claw-free;
On the approximability of the maximum induced matching problem
Keywords: تطبیق القایی; Induced matching; Strong matching; Regular graph; Approximation algorithm; APX-completeness;