Keywords: پوشش Vertex; Computational geometry; Vertex cover; Geometric graph; NP-hardness; FPT;
مقالات ISI پوشش Vertex (ترجمه نشده)
مقالات زیر هنوز به فارسی ترجمه نشده اند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
Keywords: پوشش Vertex; 05C69; 05C85; Grundy total domination number; Vertex cover; Tree; Split graph; Modular decomposition;
Keywords: پوشش Vertex; Graph algorithm; Alliance; Clique-width; Vertex cover;
Keywords: پوشش Vertex; Metaheuristics; Greedy algorithm; Combinatorial optimization; Minimum label spanning tree; Vertex cover; Independent set; Iterated greedy; Carousel greedy;
Keywords: پوشش Vertex; Penalty; Submodular; Vertex cover; Primal-dual; Approximation algorithm
Keywords: پوشش Vertex; Relation algebra; Cardinality operation; Point axiom; Decomposition; Graph parameter; Matching; Vertex cover; Bipartite relation;
Keywords: پوشش Vertex; Approximation algorithms; Approximation hardness; Vertex cover; Set cover; Dense hypergraphs; k-partite k-uniform hypergraphs
Keywords: پوشش Vertex; Parallel algorithms; Recursive backtracking; Load balancing; Vertex cover; Dominating set
Keywords: پوشش Vertex; Parameterized complexity; Connectivity problems; Kernel lower bounds; Vertex cover; Edge cover
Keywords: پوشش Vertex; Graph algorithms; Vertex cover; Common subgraph isomorphism; Maximum common subgraph; Fixed-parameter tractability
Keywords: پوشش Vertex; Approximation algorithm; Vertex cover; Knapsack cover inequality; LP rounding
Keywords: پوشش Vertex; Dotted interval graphs; Independent set; Vertex cover; Dominating set; Deletion problems
Keywords: پوشش Vertex; Vertex cover; Transversal number; Matching; Hypergraphs; Clique covering; NP-hardness
Keywords: پوشش Vertex; Approximation algorithms; Probabilistic methods; Randomised rounding; Hitting set; Vertex cover; Greedy algorithms
Keywords: پوشش Vertex; kk-path vertex cover; Vertex cover; Kernelization; Crown reduction
Keywords: پوشش Vertex; Fixed-parameter tractable; Extended formulation; Vertex cover; Independent set; Cardinality constrained; Hitting set
A 2k-kernelization algorithm for vertex cover based on crown decomposition
Keywords: پوشش Vertex; Vertex cover; Crown decomposition; Kernelization; FPT algorithms; NP-completeness;
Algorithms, kernels and lower bounds for the Flood-It game parameterized by the vertex cover number
Keywords: پوشش Vertex; Flood-It; Flood-filling; Vertex cover; FPT; Kernel; ETH;
Minimum connected transversals in graphs: New hardness results and tractable cases using the price of connectivity
Keywords: پوشش Vertex; Vertex cover; Feedback vertex set; Odd cycle transversal; Price of connectivity;
Treewidth and Pathwidth parameterized by the vertex cover number
Keywords: پوشش Vertex; Treewidth; Pathwidth; Vertex cover; Parameterized algorithms;
PSPIKE+: A family of parallel hybrid sparse linear system solvers
Keywords: پوشش Vertex; Parallel hybrid linear system solvers; Reordering; Graph partitioning; Vertex cover; Overlapping diagonal block preconditioner; Krylov subspace methods
A multivariate framework for weighted FPT algorithms
Keywords: پوشش Vertex; Parameterized algorithm; Weighted graph problem; Vertex cover; 3-Hitting set; Edge dominating set;
Vertex Covering and Strong Covering of Flower Like Network Structures
Keywords: پوشش Vertex; Vertex cover; Edge cover; Invertible graphs; Flower graphs
Branch-and-reduce exponential/FPT algorithms in practice: A case study of vertex cover
Keywords: پوشش Vertex; Branch-and-reduce; Vertex cover; Exact exponential algorithms; FPT algorithms
Using a new zero forcing process to guarantee the Strong Arnold Property
Keywords: پوشش Vertex; 05C50; 05C57; 05C83; 15A03; 15A18; 15A29Strong Arnold Property; SAP zero forcing; Minimum rank; Maximum nullity; Colin de Verdière type parameter; Vertex cover
Distance kk-domination, distance kk-guarding, and distance kk-vertex cover of maximal outerplanar graphs
Keywords: پوشش Vertex; Distance; Domination; Guarding; Vertex cover; Maximal outerplanar graph
A PTAS for the minimum weight connected vertex cover P3P3 problem on unit disk graphs
Keywords: پوشش Vertex; PTAS; Vertex cover; P3P3 cover; Minimum weight cover; Connected cover; c-Local problem; Unit disk graph; Grid graph
The kk-path vertex cover of rooted product graphs
Keywords: پوشش Vertex; kk-path vertex cover; Vertex cover; Independence number; Dissociation number; Rooted product
On the weighted kk-path vertex cover problem
Keywords: پوشش Vertex; Weighted graph; Vertex cover; Tree; Graph algorithm
PPAD-completeness of polyhedral versions of Sperner’s Lemma
Keywords: پوشش Vertex; Computational complexity; Colouring of polyhedra; Vertex cover
A new lower bound on the independence number of graphs
Keywords: پوشش Vertex; Independence number; Graphs; Variance; Expectation; Vertex cover
On the kk-path vertex cover of some graph products
Keywords: پوشش Vertex; kk-path vertex cover; Vertex cover; Dissociation number; Independence number; Graph products
Solving min ones 2-sat as fast as vertex cover
Keywords: پوشش Vertex; Min ones 2-sat; Vertex cover; Linear programming relaxation; Parameterized complexity
Vertex covers and eternal dominating sets
Keywords: پوشش Vertex; Eternal dominating set; Vertex cover
d-Transversals of stable sets and vertex covers in weighted bipartite graphs
Keywords: پوشش Vertex; Transversal; Matching; Stable set; Vertex cover; Bipartite graph; Network flow
Approximating vertex cover in dense hypergraphs
Keywords: پوشش Vertex; Approximation algorithms; Approximation hardness; Vertex cover; Set cover; Dense hypergraphs; k-partite k-uniform hypergraphs
Approximation algorithms for a geometric set cover problem
Keywords: پوشش Vertex; Guarding set of segments; Art-gallery problem; Approximation algorithm; Set cover; Vertex cover
A kernel of order 2k−c2k−c for Vertex Cover
Keywords: پوشش Vertex; Fixed parameter tractable; Kernel; Vertex Cover
Minimum kk-path vertex cover
Keywords: پوشش Vertex; Algorithm; Path; Vertex cover; Dissociation number; Path vertex cover; NP-complete
Parameterized algorithms for double hypergraph dualization with rank limitation and maximum minimal vertex cover
Keywords: پوشش Vertex; Hypergraph transversal; Vertex cover; Solution space; Parameterized algorithm
The most vital nodes with respect to independent set and vertex cover
Keywords: پوشش Vertex; Most vital vertices; Independent set; Vertex cover; Time complexity; NP-hard; Bipartite graph; Bounded treewidth; Cograph
Excessive factorizations of bipartite multigraphs
Keywords: پوشش Vertex; Excessive factorization; Bipartite multigraph; Matching theory; Network flow; Vertex cover
Cubicity, boxicity, and vertex cover
Keywords: پوشش Vertex; Boxicity; Cubicity; Vertex cover
Faster computation of maximum independent set and parameterized vertex cover for graphs with maximum degree 3
Keywords: پوشش Vertex; Maximum independent set; Exact exponential algorithms; Vertex cover; Parameterized complexity
Minimum entropy orientations
Keywords: پوشش Vertex; Approximation algorithm; Entropy; Graph orientation; Vertex cover;
Very large cliques are easy to detect
Keywords: پوشش Vertex; Clique function; Monotone circuits; Perfect hashing; Vertex cover; Critical graphs
Crown reductions for the Minimum Weighted Vertex Cover problem
Keywords: پوشش Vertex; Vertex cover; Nemhauser–Trotter theorem; Crown reductions
A list heuristic for vertex cover
Keywords: پوشش Vertex; Vertex cover; Approximation algorithm; List heuristic
Minimum 2SAT-DELETION: Inapproximability results and relations to Minimum Vertex Cover
Keywords: پوشش Vertex; Approximation hardness; 2SAT-Deletion; Vertex cover
A packet filter placement problem with application to defense against spoofed denial of service attacks
Keywords: پوشش Vertex; Combinatorial optimization; Internet; Route-based packet filtering; Spoofed denial of service attack; Vertex cover