Skip to main navigation
Skip to search
Skip to main content
Ben-Gurion University Research Portal Home
Help & FAQ
Home
Profiles
Research output
Research units
Prizes
Press/Media
Student theses
Activities
Research Labs / Equipment
Datasets
Projects
Search by expertise, name or affiliation
l-path vertex cover is easier than l-hitting set for small l.
Dekel Tsur
Department of Computer Science
Research output
:
Working paper/Preprint
›
Preprint
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'l-path vertex cover is easier than l-hitting set for small l.'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Mathematics
Hitting Set
100%
Vertex Cover
83%
Path
50%
Parameterized Algorithms
32%
Time Complexity
25%
Undirected Graph
22%
Integer
12%