Linear time low tree-width partitions and algorithmic consequences

Abstract

Definition and algorithmic properties of bounded expansion classes of graphs

Keywords

• Linear
• tree-width
• partitions
• algorithmic
• consequences