Complexity of simplicial homology and independence complexes of chordal graphs (Q679745): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.comgeo.2016.05.003 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Star clusters in independence complexes of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note: Combinatorial Alexander duality -- a short and elementary proof / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient edge domination in regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vietoris-Rips complexes of planar point sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On rigid circuit graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3655278 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Computational Complexity of Betti Numbers: Reductions from Matrix Rank / rank
 
Normal rank
Property / cites work
 
Property / cites work: The topology of the independence complex / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational aspects of monotone dualization: a brief survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexes of directed trees and independence complexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Dualization of Monotone Disjunctive Normal Forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certain homology cycles of the independence complex of grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topology of random clique complexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4418120 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence complexes of chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial algebraic topology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect edge domination and efficient edge domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity and algorithms for Euler characteristic of simplicial complexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4227352 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognition of collapsible complexes is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shellable graphs and sequentially Cohen-Macaulay bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex decomposable graphs and obstructions to shellability / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.COMGEO.2016.05.003 / rank
 
Normal rank

Latest revision as of 00:38, 10 December 2024

scientific article
Language Label Description Also known as
English
Complexity of simplicial homology and independence complexes of chordal graphs
scientific article

    Statements

    Complexity of simplicial homology and independence complexes of chordal graphs (English)
    0 references
    0 references
    0 references
    19 January 2018
    0 references
    computational complexity
    0 references
    homology
    0 references
    clique complex
    0 references
    independence complex
    0 references
    chordal graph
    0 references

    Identifiers