In this paper, we present efficient layouts for complete graphs and star graphs. We show that an N-node complete graph can be optimally laid out using LN2/4] tracks for a colinear layout, and can be laid out in N4/16 + o(N4) area for a 2D layout. We also show that an N-node star graph can be laid out in N2/16 + o(N2) area, which is smaller than any possible layout of a similar-size hypercube. T...

It is well known that a construction project is the process of resource consumption. Especially for large project, more kinds of resources are involved and the amount is very huge. In construction process of a project, the resource is limited and the time is very urgent, so for large scale project management there are some important subjects such as how to effectively distribute resources betwe...