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
Approximating k-Connected m-Dominating Sets
Zeev Nutov
Computer Science discipline
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Approximating k-Connected m-Dominating Sets'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Mathematics
Dominating Set
100%
Unit Disk Graph
15%
Vertex of a graph
12%
Weighted Graph
11%
Graph in graph theory
10%
Connectivity
9%
Subgraph
9%
Unit
7%
Subset
6%
Approximation
5%