146 search results - page 4 / 30 » Connectivity of chamber graphs of buildings and related comp... |
WWW
2004
ACM
16 years 12 days ago
2004
ACM
The goal is to build a general framework for ad hoc applications over large networks using semantics and complex systems analysis. The first part deals with semantics because appl...
DM
2007
14 years 11 months ago
2007
Recurrence relations are derived for the numbers of labeled 3-regular graphs with given connectivity, order, number of double edges, and number of loops. This work builds on metho...
GLVLSI
2009
IEEE
2009
IEEE
On the complexity of graph cuboidal dual problems for 3-D floorplanning of integrated circuit design
15 years 6 months ago
This paper discusses the impact of migrating from 2-D to 3-D on floorplanning and placement. By looking at a basic formulation of graph cuboidal dual problem, we show that the 3-...
111
click to vote
STOC
2010
ACM
15 years 3 months ago
2010
ACM
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
107
click to vote
IWPEC
2009
Springer
15 years 6 months ago
2009
Springer
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...