Skip to main navigation
Skip to search
Skip to main content
Open University of Israel Home
Pure Tutorial for OUI staff
English
עברית
العربية
Home
Researchers
Research units
Research outputs
Prizes
Activities
Search by expertise, name or affiliation
Small ℓ-edge-covers in k-connected graphs
Zeev Nutov
Computer Science discipline
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Small ℓ-edge-covers in k-connected graphs'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Connected Graph
100%
K-connected
100%
Edge Cover
100%
Small Edges
100%
Tight
33%
Graph Problems
33%
Approximation Ratio
33%
Dual Problem
33%
NP-hard
33%
Node Connectivity
33%
K-connected Graph
33%
Connected Subgraphs
33%
Spanning Subgraph
33%
Minimum Degree
33%
Edge-connected
33%
K-edge
33%
Unit Cost
33%
I(d)
33%
Number of Edges
33%
Mathematics
Edge
100%
Connected Graph
100%
Edge Cover
100%
Integer
33%
Dual Problem
33%
Unit Costs
33%