Algorithmic complexity of finding cross-cycles in flag complexes (Q2874564)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Algorithmic complexity of finding cross-cycles in flag complexes |
scientific article; zbMATH DE number 6327754
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithmic complexity of finding cross-cycles in flag complexes |
scientific article; zbMATH DE number 6327754 |
Statements
Algorithmic complexity of finding cross-cycles in flag complexes (English)
0 references
7 August 2014
0 references
chordal graphs
0 references
computational topology
0 references
homology groups
0 references
independence complex
0 references
0.8828012
0 references
0 references
0.8698533
0 references
0.8644103
0 references
0.86261225
0 references
0.85133725
0 references
0.84870744
0 references
0.84870744
0 references
0.8463759
0 references
0 references
