Chapter 7 Tree-width and the excluded minor theorem One of the highlights in the Robertson-Seymour theory on graph minors is the finiteness (for each fixed surface S) of the set of the minimal ...

We allow preprocessing the graph using a linear amount of extra space to store auxiliary information, and using this information to answer shortest path queries quickly. Our approach uses A* search in ...

Abstract: The celebrated Four Functions Theorem of Ahlswede and Daykin is a functional correlation inequality on distributive lattices with myriad applications. Ruozzi proved a variant of the ...