Algorithmic complexity of finding cross-cycles in flag complexes

DOI10.1145/2261250.2261258zbMath1293.05228OpenAlexW2076990722MaRDI QIDQ2874564

Michał Adamaszek, Juraj Stacho

Publication date: 7 August 2014

Published in: Proceedings of the twenty-eighth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2261250.2261258

zbMATH Keywords

chordal graphshomology groupscomputational topologyindependence complex

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Relations of low-dimensional topology with graph theory (57M15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (1)

The Persistent Homology of Cyclic Graphs

This page was built for publication: Algorithmic complexity of finding cross-cycles in flag complexes