Sciweavers

TCS
1998
15 years 4 months ago
A Partial k-Arboretum of Graphs with Bounded Treewidth
The notion of treewidth has seen to be a powerful vehicle for many graph algorithmic studies. This survey paper wants to give an overview of many classes of graphs that can be see...
Hans L. Bodlaender
132
Voted
TCS
1998
15 years 4 months ago
Non-Commutative Arithmetic Circuits: Depth Reduction and Size Lower Bounds
Eric Allender, Jia Jiao, Meena Mahajan, V. Vinay