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
Projects
Activities
Datasets
Research Labs / Equipment
Search by expertise, name or affiliation
The balanced connected subgraph problem
Sujoy Bhore
, Sourav Chakraborty
, Satyabrata Jana
, Joseph S.B. Mitchell
, Supantha Pandit
, Sasanka Roy
Research output
:
Contribution to journal
›
Article
›
peer-review
2
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'The balanced connected subgraph problem'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
2-coloring
100%
Balanced Hypergraph
100%
Bipartite Graph
100%
Blue Color
50%
Chordal Graph
50%
Color Assignment
50%
Diameter Two
50%
Graph Algorithms
50%
Graph Classes
50%
Graph Problems
100%
Graph Tree
50%
Induced Subgraph
50%
Maximum Cardinality
50%
NP-hard
50%
NP-hardness
50%
Planar Graph
50%
Polynomial-time Algorithm
50%
Split Graphs
50%
Vertex Set
50%
Mathematics
Bipartite Graph
100%
Cardinality
50%
Graph Algorithm
50%
Induced Subgraph
100%
Planar Graph
50%
Polynomial Time
50%