Found 6 document(s)
Page 1 of 1
-
Neural networks have become a very popular tool for many machine learning tasks, as in recent years we witnessed many novel architectures, learning and optimization techniques for deep learning. Capitalizing on the fact ...
-
In 1990, Thomas proved that every graph admits a tree decomposition of minimum width that additionally satisfies a certain vertex-connectivity condition called leanness [A Menger-like property of tree-width: The finite c...
-
The graph parameter of {\sl pathwidth} can be seen as a measure of the topological resemblance of a graph to a path. A popular definition of pathwidth is given in terms of {\sl node search} where we are given a system of...
-
We provide an exposition of the main results of the theory of bidimensionality in parameterized algorithm design. This theory applies to graph problems that are bidimensional in the sense that i) their solution value is ...
-
National Institute of Informatics (NII) Shonan workshops aspires to be an Asian “answer” to Dagstuhl. It has started just a couple of years ago and already attracted a number of interesting meetings with a large number o...