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
Minimum Color Sum of Bipartite Graphs
Amotz Bar-Noy, Guy Kortsarz
Computer Science
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Minimum Color Sum of Bipartite Graphs'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Bipartite Graph
100%
Approximation Algorithms
40%
Maximum Independent Set
40%
Sum Problem
40%
General Graphs
20%
Approximation Scheme
20%
Approximation Ratio
20%
Maximum Degree
20%
Polynomial Approximation
20%
P-NP
20%
Coloring Problem
20%
Flow Method
20%
Computer Science
Bipartite Graph
100%
Approximation Algorithms
40%
Independent Set
40%
Coloring Problem
20%
approximation scheme
20%
Approximation Ratio
20%
Polynomial Approximation
20%
Mathematics
Bipartite Graph
100%
Maximum Independent Set
40%
Polynomial
20%
Maximum Degree
20%
Polynomial Approximation
20%