Filters








3 Hits in 1.8 sec

Grundy Distinguishes Treewidth from Pathwidth

Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi, Peter Sanders, Fabrizio Grandoni, Grzegorz Herman
2020 European Symposium on Algorithms  
It would thus appear that the extra generality of treewidth over pathwidth often comes "for free".  ...  Structural graph parameters, such as treewidth, pathwidth, and clique-width, are a central topic of study in parameterized complexity.  ...  Dotted arrows indicate that the parameter may increase exponentially, (e.g. graphs of vc k have nd at most 2 k + k). 14:6 Grundy Distinguishes Treewidth from Pathwidth Defensive Stackelberg Game for  ... 
doi:10.4230/lipics.esa.2020.14 dblp:conf/esa/Belmonte0LMO20 fatcat:akce2hcqojh2fnl7d364ulgiri

Grundy Distinguishes Treewidth from Pathwidth [article]

Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi
2020 pre-print
It would thus appear that the extra generality of treewidth over pathwidth often comes "for free".  ...  Structural graph parameters, such as treewidth, pathwidth, and clique-width, are a central topic of study in parameterized complexity.  ...  Our main interest is concentrated in the first two results, which achieve our goal of finding a natural problem distinguishing pathwidth from treewidth.  ... 
doi:10.4230/lipics.esa.2020.38 arXiv:2008.07425v1 fatcat:opln4ucq4rbgtkjn5qlbpb22ky

Introduction to Reconfiguration

Naomi Nishimura
2018 Algorithms  
The solution space can be represented as a reconfiguration graph, where two vertices representing solutions are adjacent if one can be formed from the other in a single step.  ...  ) and trees (with treewidth one) to graphs of pathwidth k or treewidth k for a given constant k.  ...  Various graph classes are characterized by various width measures, such as pathwidth and treewidth (measures of how path-like or tree-like a graph is); one can generalize from paths (with pathwidth one  ... 
doi:10.3390/a11040052 fatcat:nmokeftdqrgtpdyh2ohl3tchce