A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
In previous work, we introduced median decompositions, a generalisation of tree decompositions where a graph can be modelled after any median graph, along with a hierarchy of i-medianwidth parameters (mw_i)_i≥ 1 starting from treewidth and converging to the clique number. We introduce another graph parameter based on the concept of median decompositions, to be called i-latticewidth and denoted by lw_i, for which we restrict the modelling median graph of a decomposition to be isometricallyarXiv:1603.06871v1 fatcat:djtdhw6kyjfsbj23mademzeyam