Skip to main navigation
Skip to search
Skip to main content
Ben-Gurion University Research Portal Home
Help & FAQ
Home
Profiles
Research output
Research units
Prizes
Press/Media
Student theses
Activities
Research Labs / Equipment
Datasets
Projects
Search by expertise, name or affiliation
The complete optimal stars-clustering-tree problem
Ephraim Korach
, Michal Stern
Department of Industrial Engineering and Management
Research output
:
Contribution to journal
›
Article
›
peer-review
15
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'The complete optimal stars-clustering-tree problem'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Motivation
100%
Cluster Tree
100%
Star Clustering
100%
Intersection Graph
50%
Complete Graph
50%
NP-hard
50%
Polynomial-time Algorithm
50%
Minimum Cost
50%
Database Management Systems
50%
Minimum Weight Spanning Tree
50%
Feasible Solution
50%
Tree Network
50%
Fault Tolerance
50%
Structure Theorem
50%
Communication Tree
50%
Disjoint Groups
50%
Group Privacy
50%
Cost Weight
50%
Computer Science
Spanning Tree
100%
Database Systems
100%
Feasible Solution
100%
Tree Network
100%
fault-tolerance
100%
Polynomial Algorithm
100%
Intersection Graph
100%
Mathematics
Tree Problem
100%
Intersection Graph
50%
Edge
50%
Complete Graph
50%
Polynomial
50%
Spanning Tree
50%
Feasible Solution
50%
Structure Theorem
50%
Tree Network
50%