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
Robust subgraphs for trees and paths
Refael Hassin,
Danny Segev
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Robust subgraphs for trees and paths'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Approximation Ratio
100%
Heaviest Paths
100%
Polynomial-time Algorithm
100%
Weighted Graph
100%
Small Subgraphs
100%
K-edge
100%
Graph Problems
100%
Approximate Solution
100%
Near-optimal Solution
100%
Balanced Decomposition
100%
Mathematics
Edge
100%
Polynomial Time
50%
weighted graph
50%
Tree Problem
50%
Approximate Solution
50%