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
Degree constrained node-connectivity problems
Zeev Nutov
Computer Science
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Degree constrained node-connectivity problems'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Connection Problem
100%
Node Connectivity
100%
Constrained Nodes
100%
Degree Constrained
100%
Undirected Graph
60%
Graph Problems
60%
Network Problems
40%
Survivable Networks
40%
Approximation Ratio
20%
Directed Graph
20%
K-connected Graph
20%
Element Connectivity
20%
Constrained Problems
20%
Connection Degree
20%
Simple Proof
20%
K-edge
20%
Rounding Method
20%
Iterative Rounding
20%
Computer Science
Directed Graphs
100%
Connectivity Problem
100%
Constrained Node
100%
Subgraphs
50%
Approximation Ratio
25%
Approximation (Algorithm)
25%
Connected Subgraph
25%
Connectivity Degree
25%
Mathematics
Edge
100%
Rounding
100%