Search

Your search keyword '"Vertex cover"' showing total 3,814 results

Search Constraints

Start Over You searched for: Descriptor "Vertex cover" Remove constraint Descriptor: "Vertex cover"
3,814 results on '"Vertex cover"'

Search Results

1. On the parameterized complexity of Sparsest Cut and Small-Set Expansion problems.

2. Parameterized Complexity of Streaming Diameter and Connectivity Problems.

3. b-Coloring Parameterized by Clique-Width.

4. Faster algorithms for sparse ILP and hypergraph multi-packing/multi-cover problems.

5. Finding Optimal Solutions with Neighborly Help.

6. Approximation Algorithms for Partial Vertex Covers in Trees.

7. Local Optima in Diversity Optimization: Non-trivial Offspring Population is Essential

8. The Parameterized Complexity of Maximum Betweenness Centrality

9. Sparsity in Covering Solutions

10. Parameterized Algorithms for Minimum Sum Vertex Cover

11. Faster Winner Determination Algorithms for (Colored) Arc Kayles

12. Complexity of the (Connected) Cluster Vertex Deletion Problem on H-free Graphs.

13. Certified Vertex Cover of a Graph.

14. Winner Determination Algorithms for Graph Games with Matching Structures.

15. Stability, Vertex Stability, and Unfrozenness for Special Graph Classes.

16. On the d-Claw Vertex Deletion Problem.

17. Bounds on the Clique and the Independence Number for Certain Classes of Graphs.

18. Vertex Cover Hop Dominating Sets in Graphs.

19. Small Vertex Cover Helps in Fixed-Parameter Tractability of Graph Deletion Problems over Data Streams.

20. Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry.

21. Identifying Critical Nodes in a Network

22. Upper Clique Transversals in Graphs

23. Stackelberg Vertex Cover on a Path

24. Approximating Power Node-Deletion Problems

26. Parameterized-NL Completeness of Combinatorial Problems by Short Logarithmic-Space Reductions and Immediate Consequences of the Linear Space Hypothesis

27. Reducing the vertex cover number via edge contractions.

28. A primal-dual approximation algorithm for the k-prize-collecting minimum vertex cover problem with submodular penalties.

29. k-step Reachability Query Processing on Label-constrained Graph

30. Online Algorithms for Prize-Collecting Optimization Problems

31. Winner Determination Algorithms for Graph Games with Matching Structures

32. A Distributed Algorithm for Constructing an Independent Dominating Set

33. p-Edge/vertex-connected vertex cover: Parameterized and approximation algorithms.

34. Efficient Processing of k -Hop Reachability Queries on Directed Graphs.

35. Optimal distributed covering algorithms.

36. Building large k-cores from sparse graphs.

37. Bounds on the Clique and the Independence Number for Certain Classes of Graphs

38. Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs.

39. Parameterized Complexity of Computing Maximum Minimal Blocking and Hitting Sets.

40. Upper and lower bounds on approximating weighted mixed domination.

42. Vertex-edge Roman domination in graphs: Complexity and algorithms.

43. Above guarantee parameterization for vertex cover on graphs with maximum degree 4.

44. The dominant edge metric dimension of graphs.

45. Second Powers of Cover Ideals of Paths.

46. The NF-Number of a Simplicial Complex.

47. Possibilistic Data Cleaning.

48. Approximating power node-deletion problems.

50. Extending Lattice Linearity for Self-stabilizing Algorithms

Catalog

Books, media, physical & digital resources