1648 search results - page 208 / 330 » On the generation of bicliques of a graph |
ICPPW
2005
IEEE
14 years 2 months ago
2005
IEEE
This paper compares two methods for running an application composed of a set of modules on a grid. The set of modules (collectively called Montage) generates large astronomical im...
ICRA
2005
IEEE
14 years 2 months ago
2005
IEEE
Abstract— Landmark-based graphs are a useful and parsimonious tool for representing large scale environments. Relating landmarks by means of feedback-control algorithms encoded i...
HIPC
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. Linear scan register allocation is an attractive register allocation algorithm because of its simplicity and fast running time. However, it is generally felt that linear ...
WADS
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. In this paper we consider a generalization of the edge dominating set (EDS) problem, in which each edge e needs to be covered be times and refer to this as the b-EDS prob...
LATIN
2004
Springer
14 years 2 months ago
2004
Springer
Consider a game in which edges of a graph are provided a pair at a time, and the player selects one edge from each pair, attempting to construct a graph with a component as large ...