Memory efficient algorithms for cactus graphs and block graphs (Q528335): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.dam.2015.10.032 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DAM.2015.10.032 / rank | |||
Normal rank | |||
Revision as of 03:34, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Memory efficient algorithms for cactus graphs and block graphs |
scientific article |
Statements
Memory efficient algorithms for cactus graphs and block graphs (English)
0 references
12 May 2017
0 references
constant-work-space algorithm
0 references
in-place algorithm
0 references
shortest path
0 references
cactus graph
0 references
block graph
0 references
chromatic polynomial
0 references
0 references
0 references
0 references
