Complexity of simplicial homology and independence complexes of chordal graphs
From MaRDI portal
Publication:679745
DOI10.1016/j.comgeo.2016.05.003zbMath1386.65086OpenAlexW2370347111MaRDI QIDQ679745
Michał Adamaszek, Juraj Stacho
Publication date: 19 January 2018
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2016.05.003
Related Items
Strong collapse and persistent homology ⋮ A note on independence complexes of chordal graphs and dismantling ⋮ Perfect matching complexes of honeycomb graphs ⋮ Strong Collapse for Persistence ⋮ Homotopy type of circle graph complexes motivated by extreme Khovanov homology ⋮ Computing Persistent Homology of Flag Complexes via Strong Collapses ⋮ Graph pseudometrics from a topological point of view
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Star clusters in independence complexes of graphs
- On rigid circuit graphs
- Shellable graphs and sequentially Cohen-Macaulay bipartite graphs
- Computational aspects of monotone dualization: a brief survey
- Certain homology cycles of the independence complex of grids
- Vietoris-Rips complexes of planar point sets
- Independence complexes of chordal graphs
- Efficient edge domination in regular graphs
- Topology of random clique complexes
- Complexes of directed trees and independence complexes
- Note: Combinatorial Alexander duality -- a short and elementary proof
- Induced matchings
- Perfect edge domination and efficient edge domination in graphs
- Algorithmic graph theory and perfect graphs
- Complexity and algorithms for Euler characteristic of simplicial complexes
- The topology of the independence complex
- Vertex decomposable graphs and obstructions to shellability
- On the Complexity of Dualization of Monotone Disjunctive Normal Forms
- On the Computational Complexity of Betti Numbers: Reductions from Matrix Rank
- Combinatorial algebraic topology
- Recognition of collapsible complexes is NP-complete
