Keywords: کرنل شدن; Social networks; Clusters; Clubs; FPT algorithms; Kernelization;
مقالات ISI کرنل شدن (ترجمه نشده)
مقالات زیر هنوز به فارسی ترجمه نشده اند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
Keywords: کرنل شدن; Fidelity preserving transformation; Fixed parameter tractability; Kernelization; Parameterized complexity; Approximation algorithms;
Keywords: کرنل شدن; Unit interval graph; Kernelization; Graph modification problem; Forbidden induced subgraph; (Proper, unit) interval model; Modulator;
Keywords: کرنل شدن; Edge dominating set; Maximum matching; Combinatorial problems; Parameterized algorithm; Kernelization;
Keywords: کرنل شدن; Cluster editing; Fixed-parameter tractability; Multi-parameterization; Kernelization;
Keywords: کرنل شدن; Graph algorithms; Bipartition; Kernelization; NP-hard; Fixed-parameter tractable;
Keywords: کرنل شدن; Induced common isomorphism; Parameterized complexity; Kernelization; ETH based lower bounds;
Keywords: کرنل شدن; Parameterized complexity; Kernelization; Nowhere dense graphs; Finite integer index; Treedepth;
Keywords: کرنل شدن; Parameterized complexity; Kernelization; Perfect code;
Keywords: کرنل شدن; Parameterized complexity; Kernelization; Integer linear programs;
Keywords: کرنل شدن; Computational biology; Common string partition; Parameterized algorithms; Kernelization;
Keywords: کرنل شدن; Cycle packing; Kernelization; Multivariate algorithms; Induced structures;
Keywords: کرنل شدن; Kernelization; Fixed parameterized algorithms
Keywords: کرنل شدن; Graph cut problems; Treewidth; Kernelization;
Keywords: کرنل شدن; Parameterized complexity; Kernelization; Rank-width; Clique-width; Boolean-width; Monadic second-order logic; Modular decomposition
Keywords: کرنل شدن; Module motif; Pattern matching; Parameterized algorithm; Kernelization; Computational biology;
Keywords: کرنل شدن; Fixed-parameter tractability; Kernelization; Phylogenetic tree; Phylogenetic network; Hybridization number
Keywords: کرنل شدن; Computational social choice; Possible winner; Voting; Kernelization; Parameterized complexity
Keywords: کرنل شدن; Cut problems; Steiner multicut; Parameterized complexity; Kernelization
Keywords: کرنل شدن; Parameterized algorithms; Clique cover; Kernelization; Average case; Random intersection graphs; Erdős–Rényi graphs
Keywords: کرنل شدن; Parameterized complexity; Kernelization; Heuristics; f-Factors; Data privacy
Keywords: کرنل شدن; Parameterized algorithm; Kernelization; Approximation algorithm; Combinatorial bounds; Differential of a graph
Keywords: کرنل شدن; Graph modification; Degree-constrained editing; NP-hardness; Parameterized complexity; Fixed-parameter tractability; Kernelization
Keywords: کرنل شدن; Complexity of automated planning; Parameterized complexity; Kernelization
Keywords: کرنل شدن; Triangle packing; Kernelization; Linear kernel; Fixed-parameter tractable; Graph algorithms
Keywords: کرنل شدن; Crossing minimization; Fixed parameter tractable; Graph drawing; Kernelization; Two-layer drawing
Keywords: کرنل شدن; Maximum strip recovery; FPT algorithm; Kernelization
Keywords: کرنل شدن; Firefighter problem; Fixed parameter tractability; Kernelization
Keywords: کرنل شدن; Fixed-parameter tractability; Kernelization; Constraint satisfaction; Reasoning; Computational complexity
Keywords: کرنل شدن; Kernelization; Multiplicative updates; Rotational invariance; Exponentiated Gradient algorithm; Gradient Descent algorithm
Keywords: کرنل شدن; Parameterized algorithm; Kernelization; Connected vertex cover; Edge dominating set; Maximum triangle packing;
Keywords: کرنل شدن; kk-path vertex cover; Vertex cover; Kernelization; Crown reduction
Keywords: کرنل شدن; Graph packing; Parameterized complexity; Kernelization
A 2k-kernelization algorithm for vertex cover based on crown decomposition
Keywords: کرنل شدن; Vertex cover; Crown decomposition; Kernelization; FPT algorithms; NP-completeness;
Kernels for deletion to classes of acyclic digraphs
Keywords: کرنل شدن; Out-forest; Pumpkin; Parameterized complexity; Kernelization;
Meta-kernelization using well-structured modulators
Keywords: کرنل شدن; Kernelization; Parameterized complexity; Structural parameters; Rank-width; Split decompositions;
On the kernelization of split graph problems
Keywords: کرنل شدن; Split graph; Kernelization; Parameterized complexity; k-path; k-cycle; Crown decomposition;
On the kernelization complexity of string problems
Keywords: کرنل شدن; String problems; Closest String; Kernelization; Cross-composition;
Fast convex-hull vector machine for training on large-scale ncRNA data classification tasks
Keywords: کرنل شدن; Large scale ncRNA data classification; Fast convex hull approximation; Support vector machines; Kernelization;
Improved kernel results for some FPT problems based on simple observations
Keywords: کرنل شدن; Fixed-parameter tractability; NP-hard; Kernelization;
On a generalization of Nemhauser and Trotter's local optimization theorem
Keywords: کرنل شدن; Kernelization; Fixed-parameter tractable; Graph algorithms; Graph theory; Graph decomposition; Bounded-degree vertex deletion;
Linear kernels for k-tuple and liar's domination in bounded genus graphs
Keywords: کرنل شدن; k-tuple domination; Liar's domination; Planar graphs; Bounded genus graphs; Kernelization; W[2]-hard;
Polynomial kernels for deletion to classes of acyclic digraphs
Keywords: کرنل شدن; 68R10; 05C10; 05C85; Directed feedback vertex set; Kernelization; Out-forest;
A 9k kernel for nonseparating independent set in planar graphs
Keywords: کرنل شدن; Fixed parameter algorithms; Kernelization; Planar graphs; Connected vertex cover; Nonseparating independent set
Matching and Weighted P2P2-Packing: Algorithms and Kernels
Keywords: کرنل شدن; Parameterized algorithm; Kernelization; Weighted P2P2-Packing; Matching
A linear vertex kernel for maximum internal spanning tree
Keywords: کرنل شدن; Algorithm; Crown decomposition; Kernelization; Parameterized complexity; Preprocessing
Two edge modification problems without polynomial kernels
Keywords: کرنل شدن; Parameterized complexity; Kernelization; Graph modification problems
Towards optimal kernel for connected vertex cover in planar graphs
Keywords: کرنل شدن; Kernelization; Planar graphs; Connected vertex cover
Kernelization for cycle transversal problems
Keywords: کرنل شدن; Kernelization; Planar graphs; Cycle transversal
Kernelization hardness of connectivity problems in dd-degenerate graphs
Keywords: کرنل شدن; Degenerate graphs; Kernelization; Connected dominating set; Graph motif