A graph-theoretical approach to cancelling critical elements (Q2840724): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.endm.2011.05.049 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1990554081 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: MORSE INEQUALITIES ON CERTAIN INFINITE 2-COMPLEXES / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A note on the pure Morse complex of a graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Morse theory for cell complexes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On optimizing discrete Morse functions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Computing Optimal Morse Matchings / rank | |||
Normal rank |
Latest revision as of 16:27, 6 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A graph-theoretical approach to cancelling critical elements |
scientific article |
Statements
A graph-theoretical approach to cancelling critical elements (English)
0 references
23 July 2013
0 references
optimal discrete Morse function
0 references
Hasse diagram
0 references
maximum matching
0 references
simplicial complex
0 references