We investigate the problem of supporting keyword-based searching for the discovery of software resources that are installed on the nodes of large-scale, federated Grid computing infrastructures. We address a number of challenges that arise from the unstructured nature of software and the unavailability of software-related metadata on Grid sites. We present Minersoft, a Grid harvester that visit...

Amonotone drawing of a planar graph G is a planar straightline drawing of G where a monotone path exists between every pair of vertices of G in some direction. Recently monotone drawings of planar graphs have been proposed as a new standard for visualizing graphs. A monotone drawing of a planar graph is a monotone grid drawing if every vertex in the drawing is drawn on a grid point. In this pap...

The grid obstacle representation of a graph G = (V,E) is an injective function f : V → Z and a set of point obstacles O on the grid points of Z (where V has not been mapped) such that uv is an edge in G if and only if there exists a Manhattan path between f(u) and f(v) in Z avoiding the obstacles of O. The grid obstacle number of a graph is the smallest number of obstacles needed for the grid o...

A Graph G is Super Strongly Perfect Graph if every induced sub graph H of G possesses a minimal dominating set that meets all the maximal complete sub graphs of H. In this paper we have analyzed the structure of super strongly perfect graphs in some Interconnection Networks, like Mesh, Torus, Hyper cubes and Grid Networks. Along with this investigation, we have characterized the Super Strongly ...

Intuitively, a tangle of large order in a graph is a highly-connected part of the graph, and it is known that if a graph has a tangle of large order then it has a large grid minor. Here we show that for any k, if G has a tangle of large order and Z is a set of vertices of cardinality k that cannot be separated from the tangle by any separation of order less than k, then G has a large grid minor...

Definition 1. A graph G is a t × t grid if it consists of t 2 vertices forming a square t × t such that every two consecutive vertices in a row or in a colum are connected. As a result of previous excercises we know that a treewidth of a t × t grid is t. A treewidth of a graph can only decrease as a result of taking minors so we can conclude that if a graph contain a t × t grid as a minor it's ...

X iv :0 80 9. 25 51 v1 [ m at h. C O ] 1 5 Se p 20 08 Spanning Trees in Grid Graphs Paul Raff July 25, 2008 Abstract A general method is obtained for finding recurrences involving the number of spanning trees of grid graphs, obtained by taking the graph product of an arbitrary graph and path or cycle. The results in this paper extend the work by Desjarlais and Molina and give concrete methods f...

A method for partitioning airspace into smaller regions based on a peak traffic-counts metric is described. The three setup steps consist of 1) creating a network flow graph, 2) creating an occupancy grid composed of grid cells of specified size for discretizing the airspace and 3) assigning the grid cells to the nodes of the network flow graph. Both the occupancy grid and the grid cell assignm...

In this paper we study connectivity and hamiltonicity properties of the topological grid graphs, which are a natural type of planar graphs associated with finite subgraphs of the usual square lattice graph of the plane. The main results are as follows. The shortness coefficient of the family of all topological grid graphs is at most 16/17. Every 3-connected topological grid graph is hamiltonian.