Skip to main navigation
Skip to search
Skip to main content
Penn State Home
Help & FAQ
Link opens in a new tab
Search content at Penn State
Home
Researchers
Research output
Research units
Equipment
Grants & Projects
Prizes
Activities
Bipartite graphs of small readability
Rayan Chikhi
, Vladan Jovičić
, Stefan Kratsch
, Paul Medvedev
, Martin Milanič
, Sofya Raskhodnikova
, Nithin Varma
Computer Science and Engineering
Biochemistry & Molecular Biology
Institute for Computational and Data Sciences (ICDS)
Huck Institutes of the Life Sciences
School of Electrical Engineering and Computer Science
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Bipartite graphs of small readability'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Readability
100%
Bipartite Graph
100%
Polynomial-time Algorithm
8%
Number of Vertices
8%
Graph Families
8%
Bioinformatics
8%
Bioinformatics Methods
8%
Latin Language
8%
Maximum Degree
8%
Applied Mathematics
8%
Induced Subgraph
8%
Overlap Graph
8%
Mathematics
Bipartite Graph
100%
Chain Graph
50%
Polynomial Time
25%
Upper Bound
25%
Maximum Degree
25%
Induced Subgraph
25%
Applied Discrete Mathematics
25%
Computer Science
Bipartite Graph
100%
Bioinformatics
50%
Polynomial Time Algorithm
25%
Subgraphs
25%