Keywords: ردیابی ثابت پارامتر; Vertex coloring; Polynomial-time algorithm; Fixed-parameter tractability;
مقالات ISI ردیابی ثابت پارامتر (ترجمه نشده)
مقالات زیر هنوز به فارسی ترجمه نشده اند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
Keywords: ردیابی ثابت پارامتر; Fixed-parameter tractability; Network reconfiguration; Kernelizaton; Branching algorithm;
Keywords: ردیابی ثابت پارامتر; Cluster editing; Fixed-parameter tractability; Multi-parameterization; Kernelization;
Keywords: ردیابی ثابت پارامتر; Computational complexity; Parameterized complexity; Fixed-parameter tractability; Privacy; Data publishing; Graph modifications; Degree-constrained editing;
Keywords: ردیابی ثابت پارامتر; Cover of a word; Partial word; String with don't cares; Indeterminate string; Fixed-parameter tractability;
Keywords: ردیابی ثابت پارامتر; Fixed-parameter tractability; Treewidth; Forbidden subgraphs;
Keywords: ردیابی ثابت پارامتر; (Total) vector dominating set; Partial dominating set; Fixed-parameter tractability; Branchwidth; Apex-minor-free graphs;
Keywords: ردیابی ثابت پارامتر; NP-hardness; Fixed-parameter tractability; W-hardness; Machine learning; Combinatorial feature selection; Dimension reduction; Minimal reduct problem; Combinatorics of binary matrices; Δ-Systems
Keywords: ردیابی ثابت پارامتر; Fixed-parameter tractability; Kernelization; Phylogenetic tree; Phylogenetic network; Hybridization number
Keywords: ردیابی ثابت پارامتر; Hardness of approximation; Approximation algorithms; Fixed-parameter tractability; Traveling salesman problem; Combinatorial game theory
Keywords: ردیابی ثابت پارامتر; Clique relaxations; Cohesive subnetworks; Social network analysis; Fixed-parameter tractability; Parameter hierarchy; Multivariate complexity analysis
Keywords: ردیابی ثابت پارامتر; Flood-It; Free-Flood-It; Shortest common supersequence; NP-hardness; W[1]-hardness; Fixed-parameter tractability
Keywords: ردیابی ثابت پارامتر; Approximation algorithm; Fixed-parameter tractability; Phylogenetic tree; Maximum agreement forest
Keywords: ردیابی ثابت پارامتر; Graph modification; Degree-constrained editing; NP-hardness; Parameterized complexity; Fixed-parameter tractability; Kernelization
Keywords: ردیابی ثابت پارامتر; Graph algorithms; Vertex cover; Common subgraph isomorphism; Maximum common subgraph; Fixed-parameter tractability
Keywords: ردیابی ثابت پارامتر; Fixed-parameter tractability; Kernelization; Constraint satisfaction; Reasoning; Computational complexity
Keywords: ردیابی ثابت پارامتر; Graph algorithms; Packing; Stars; Kernel; Fixed-parameter tractability
Keywords: ردیابی ثابت پارامتر; Dominating set; Fixed-parameter tractability; Tree decomposition; Computational Complexity
Keywords: ردیابی ثابت پارامتر; House-swapping; Inapproximability; Fixed-parameter tractability
A tight lower bound for Vertex Planarization on graphs of bounded treewidth
Keywords: ردیابی ثابت پارامتر; Vertex planarization; Fixed-parameter tractability; Exponential Time Hypothesis; Treewidth;
Improved kernel results for some FPT problems based on simple observations
Keywords: ردیابی ثابت پارامتر; Fixed-parameter tractability; NP-hard; Kernelization;
Approximability and parameterized complexity of multicover by c-intervals
Keywords: ردیابی ثابت پارامتر; Algorithms; NP-hard problems; APX-hardness; Fixed-parameter tractability; W[1]-hardness; Set cover
Algorithms for parameterized maximum agreement forest problem on multiple trees
Keywords: ردیابی ثابت پارامتر; Fixed-parameter tractability; Phylogenetic tree; Maximum agreement forest
Parameterized complexity of k-Chinese Postman Problem
Keywords: ردیابی ثابت پارامتر; Fixed-parameter tractability; Polynomial kernels; Chinese Postman Problem
A quadratic kernel for computing the hybridization number of multiple trees
Keywords: ردیابی ثابت پارامتر; Computational complexity; Fixed-parameter tractability; Generator; Hybridization; Kernel; Phylogenetic network
The parametric complexity of graph diameter augmentation
Keywords: ردیابی ثابت پارامتر; Graph augmentation; Graph diameter; Fixed-parameter tractability; W[2]W[2]-hard; Reduction
A faster FPT algorithm for Bipartite Contraction
Keywords: ردیابی ثابت پارامتر; Algorithms; Graph algorithms; Randomized algorithms; Fixed-parameter tractability; Graph modification problems
Completely inapproximable monotone and antimonotone parameterized problems
Keywords: ردیابی ثابت پارامتر; Inapproximability; Fixed-parameter tractability; Circuits; Circuit satisfiability
The cluster deletion problem for cographs
Keywords: ردیابی ثابت پارامتر; Cliques; Fixed-parameter tractability; Edge-deletion; Graph modification; Cluster deletion; Cographs; Integer partitions;
A computational-level explanation of the speed of goal inference
Keywords: ردیابی ثابت پارامتر; Goal inference; Abduction; Inverse planning; Computational complexity; Intractability; NP-hard; Fixed-parameter tractability
Fixed-parameter tractability and lower bounds for stabbing problems
Keywords: ردیابی ثابت پارامتر; Geometric stabbing; Minimum enclosing cylinder; Lower bounds; Fixed-parameter tractability
Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number
Keywords: ردیابی ثابت پارامتر; Independent set; Fixed-parameter tractability; Hereditary class of graphs; Modular decomposition
Worst-case efficient single and multiple string matching on packed texts in the word-RAM model
Keywords: ردیابی ثابت پارامتر; Independent set; Fixed-parameter tractability; Hereditary class of graphs; Modular decomposition
On making directed graphs transitive
Keywords: ردیابی ثابت پارامتر; Graph modification problem; NP-hardness; Hierarchical structure detection; Fixed-parameter tractability; Kernelization and data reduction
Augmenting tractable fragments of abstract argumentation
Keywords: ردیابی ثابت پارامتر; Abstract argumentation; Backdoors; Computational complexity; Parameterized complexity; Fixed-parameter tractability;
Towards fixed-parameter tractable algorithms for abstract argumentation
Keywords: ردیابی ثابت پارامتر; Abstract argumentation; Fixed-parameter tractability; Tree-width; Dynamic programming; Complexity;
Automata for the verification of monadic second-order graph properties
Keywords: ردیابی ثابت پارامتر; Graph algorithm; Automaton; Monadic second-order logic; Clique-width; Fixed-parameter tractability; Fly-automaton
Aspects of a multivariate complexity analysis for Rectangle Tiling
Keywords: ردیابی ثابت پارامتر; Combinatorial algorithms; NP-hardness; Computational complexity; Fixed-parameter tractability
On the computational challenges of analogy-based generalization
Keywords: ردیابی ثابت پارامتر; Generalization; Analogy; Structure-mapping; Categories; Concepts; Computational complexity; NP-hard; Fixed-parameter tractability
Graph-based data clustering with overlaps
Keywords: ردیابی ثابت پارامتر; Cluster graph modification problems; Forbidden subgraph characterization; NP-hardness; Fixed-parameter tractability; W[1]W[1]-hardness; Kernelization
Fixed-parameter tractability results for feedback set problems in tournaments
Keywords: ردیابی ثابت پارامتر; Feedback arc set; Feedback vertex set; Tournament; Bipartite tournament; Fixed-parameter tractability; Iterative compression
Tractable database design and datalog abduction through bounded treewidth
Keywords: ردیابی ثابت پارامتر; Normal forms; Database design; Tree decomposition; Bounded treewidth; Fixed-parameter tractability; Datalog abduction
Parameterized graph cleaning problems
Keywords: ردیابی ثابت پارامتر; Graph algorithm; Fixed-parameter tractability; Induced subgraph isomorphism
Fixed-parameter algorithms for protein similarity search under mRNA structure constraints
Keywords: ردیابی ثابت پارامتر; mRNA optimization; Protein similarity; Selenocysteine insertion; Parameterized complexity; Fixed-parameter tractability
Closest 4-leaf power is fixed-parameter tractable
Keywords: ردیابی ثابت پارامتر; Fixed-parameter tractability; Graph algorithm; Graph modification; Graph power; Leaf power; Forbidden subgraph characterization
Satisfiability of mixed Horn formulas
Keywords: ردیابی ثابت پارامتر; (Hidden) Horn formula; qq-Horn formula; Quadratic formula; (Weighted) Satisfiability; Minimal vertex cover; Fixed-parameter tractability
Exact algorithms and applications for Tree-like Weighted Set Cover
Keywords: ردیابی ثابت پارامتر; NP-hard problems; (Weighted) Set Cover; Multicut in trees; Minimum Weighted Edge Cover on acyclic hypergraphs; Fixed-parameter tractability
Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs
Keywords: ردیابی ثابت پارامتر; Algorithm engineering; fixed-parameter tractability; Vertex Cover; tree decomposition of graphs; planar graphs; exact algorihms;
Polynomial and APX-hard cases of the individual haplotyping problem
Keywords: ردیابی ثابت پارامتر; Haplotyping; Fixed-parameter tractability; APX-hardness;
A refined search tree technique for Dominating Set on planar graphs
Keywords: ردیابی ثابت پارامتر; NP-complete problem; Dominating set; Planar graph; Fixed-parameter tractability; Exact algorithm; Search tree;