Skip to main navigation
Skip to search
Skip to main content
University of Copenhagen Research Portal Home
Help & FAQ
Dansk
English
Home
Profiles
Research output
Research units
Press/Media
Activities
Prizes
???studenttheses???
Datasets
Search by expertise, name or affiliation
Complexity of simplicial homology and independence complexes of chordal graphs
Michal Jan Adamaszek, Juraj Stacho
Department of Mathematical Sciences
6
Citations (Scopus)
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Complexity of simplicial homology and independence complexes of chordal graphs'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Mathematics
Chordal Graphs
100%
Homology
78%
Independence
78%
NP-hardness
70%
Induced Matching
41%
Cycle
41%
Homology Groups
32%
Simplicial Complex
32%
Clique
28%
Computational Complexity
27%
Graph in graph theory
27%
NP-complete problem
22%
Observation
19%
Imply
18%
Computing
18%
Arbitrary
15%
Engineering & Materials Science
NP-hard
85%
Computational complexity
23%