Skip to main navigation
Skip to search
Skip to main content
University of Haifa Home
Update your profile
Home
Researchers
Research Units
Research output
Search by expertise, name or affiliation
Path hitting in acyclic graphs
Ojas Parekh,
Danny Segev
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Path hitting in acyclic graphs'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Mathematics
Path
100%
Hits
67%
Graph in graph theory
67%
Costs
42%
Multicut
42%
Edge Cover
41%
Spiders
41%
Multicommodity Flow
39%
Covering Problem
35%
Integrality
33%
Demand
29%
Undirected Graph
27%
Star
26%
Approximation Algorithms
25%
Polynomial time
23%
Non-negative
20%
Demonstrate
17%
Subset
16%
Family
13%
Engineering & Materials Science
Approximation algorithms
78%
Stars
74%
Polynomials
56%
Costs
55%