We introduce H -join decompositions of graphs, indexed by a fixed bipartite graph H . These decompositions are based on a graph operation that we call H -join, which adds edges be...
Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshel...
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...
Bidimensionality theory appears to be a powerful framework for the development of metaalgorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman...
Abstract— We present an efficient algorithm for complete motion planning that combines approximate cell decomposition (ACD) with probabilistic roadmaps (PRM). Our approach uses ...
We report a comprehensive evaluation of the topological structure of protein-protein interaction (PPI) networks by mining and analyzing graphs constructed from the publicly availa...