365 search results - page 17 / 73 » Reconfigurations in Graphs and Grids |
101
click to vote
IPPS
2007
IEEE
15 years 6 months ago
2007
IEEE
Hardware accelerators are increasingly used to extend the computational capabilities of baseline scalar processors to meet the growing performance and power requirements of embedd...
96
Voted
WEBI
2009
Springer
15 years 6 months ago
2009
Springer
—In this paper, we investigate the problem of supporting keyword-based searching for the discovery of software resources that are installed on the nodes of largescale, federated ...
SIAMDM
1998
14 years 11 months ago
1998
If f(m, n) is the (vertex) independence number of the m × n grid graph, then we show that the double limit η = def limm,n→∞ f(m, n) 1 mn exists, thereby refining earlier res...
136
click to vote
FOCS
2005
IEEE
15 years 5 months ago
2005
IEEE
At the core of the seminal Graph Minor Theory of Robertson and Seymour is a powerful structural theorem capturing the structure of graphs excluding a fixed minor. This result is ...
JCT
2007
14 years 11 months ago
2007
Abstract. We prove that a binary matroid with huge branchwidth contains the cycle matroid of a large grid as a minor. This implies that an infinite antichain of binary matroids ca...