Search
1 article for “tree decompositions of graphs”
-
Decomposition of Dynamic Graphs in Memory Saving with Effective Programming
Abstract: This study proposes a simple and effective heuristic to save memory in effective programming on tree decompositions when solving a graph optimization problem. The introduced “anchor technique” is based on a tree-like set covering problem. We substantiated our findings by experimental results. Our strategy has negligible computational overhead concerning running time but achieves memory savings for nice tree decompositions and path decompositions between 60% and 98%.
Published in Recent Trends in Programming languages · Vol. 1, Issue 3, 2014 · pp. 7–12 Read article