Complexity of simplicial homology and independence complexes of chordal graphs

Michal Jan Adamaszek; Juraj Stacho

doi:10.1016/j.comgeo.2016.05.003

Complexity of simplicial homology and independence complexes of chordal graphs

Michal Jan Adamaszek, Juraj Stacho

Department of Mathematical Sciences

6 Citations (Scopus)

Original language	English
Journal	Computational Geometry
Volume	57
Pages (from-to)	8-18
ISSN	0925-7721
DOIs	https://doi.org/10.1016/j.comgeo.2016.05.003
Publication status	Published - 1 Aug 2016

Keywords

Computational complexity
Homology
Clique complex
Independence complex
Chordal graph

Access to Document

10.1016/j.comgeo.2016.05.003

Cite this

@article{85f52745e0e04da8aea27e3735d1bbed,

title = "Complexity of simplicial homology and independence complexes of chordal graphs",

keywords = "Computational complexity, Homology, Clique complex, Independence complex, Chordal graph",

author = "Adamaszek, {Michal Jan} and Juraj Stacho",

year = "2016",

month = aug,

day = "1",

doi = "10.1016/j.comgeo.2016.05.003",

language = "English",

volume = "57",

pages = "8--18",

journal = "Computational Geometry: Theory and Applications",

issn = "0925-7721",

publisher = "Elsevier",

}

TY - JOUR

T1 - Complexity of simplicial homology and independence complexes of chordal graphs

AU - Adamaszek, Michal Jan

AU - Stacho, Juraj

PY - 2016/8/1

Y1 - 2016/8/1

KW - Computational complexity

KW - Homology

KW - Clique complex

KW - Independence complex

KW - Chordal graph

U2 - 10.1016/j.comgeo.2016.05.003

DO - 10.1016/j.comgeo.2016.05.003

M3 - Journal article

SN - 0925-7721

VL - 57

SP - 8

EP - 18

JO - Computational Geometry: Theory and Applications

JF - Computational Geometry: Theory and Applications

ER -

Complexity of simplicial homology and independence complexes of chordal graphs

Keywords

Access to Document

Fingerprint

Cite this