Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...
Abstract. Bootstrap percolation on an arbitrary graph has a random initial configuration, where each vertex is occupied with probability p, independently of each other, and a deter...
— Traditional multiple-antenna detectors – which search a tree or a lattice structure – typically apply a metric that requires a preprocessing. Contrary to that, we present a...
After the discussion on the difference between floorplanning and packing in VLSI placement design, this paper adapts the floorplanner that is based on the Q-sequence to a packin...
Readability is a crucial presentation attribute that web summarization algorithms consider while generating a querybaised web summary. Readability quality also forms an important ...