Memory efficient algorithms for cactus graphs and block graphs (Q528335)
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: Memory efficient algorithms for cactus graphs and block graphs |
scientific article; zbMATH DE number 6714926
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Memory efficient algorithms for cactus graphs and block graphs |
scientific article; zbMATH DE number 6714926 |
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
0.7617787718772888
0 references
0.7407901883125305
0 references
0.7388363480567932
0 references
0.7348001003265381
0 references
0.7234659790992737
0 references
