Skip to main navigation
Skip to search
Skip to main content
Ariel University Home
Help & FAQ
English
עברית
العربية
Home
Profiles
Research units
Research output
Prizes
Activities
Search by expertise, name or affiliation
Crowns in bipartite graphs
Vadim E. Levit
, Eugen Mandrescu
Department of Mathematics
Research output
:
Contribution to journal
›
Article
›
peer-review
2
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Crowns in bipartite graphs'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Bipartite Graph
100%
Local Maximum Stable Set
100%
General Graphs
50%
Well-covered Graph
50%
Greedoid
50%
Maximum Stable Set
50%
Unique Perfect Matching
50%
NP-complete
50%
Algorithm Design
50%
Computer Science
50%
Crown Structure
50%
Even Order
50%
Bergen
50%
Norway
50%
Parameterized Algorithms
50%
Kernelization
50%
Vertex Cover
50%
Mathematics
Bipartite Graph
100%
Stable Set
100%
S(G)
33%
Induced Subgraph
33%
Kernelization
33%
Perfect Matchings
33%