16 search results - page 2 / 4 » Maximum Degree Growth of the Iterated Line Graph |
GD
2001
Springer
14 years 2 months ago
2001
Springer
In an orthogonal drawing of a plane graph each vertex is drawn as a point and each edge is drawn as a sequence of vertical and horizontal line segments. A bend is a point at which...
INFOCOM
2010
IEEE
13 years 8 months ago
2010
IEEE
—Wireless sensor network (WSN) applications require redundant sensors to guarantee fault tolerance. However, the same degree of redundancy is not necessary for multi-hop communic...
WAW
2009
Springer
14 years 4 months ago
2009
Springer
We present a deterministic model for on-line social networks based on transitivity and local knowledge in social interactions. In the Iterated Local Transitivity (ILT) model, at ea...
HICSS
2002
IEEE
14 years 2 months ago
2002
IEEE
A model has been developed to study the global complex dynamics of a series of blackouts in power transmission systems [1, 2]. This model has included a simple level of self-organ...
CCCG
2007
13 years 11 months ago
2007
In this paper, we consider the following graph embedding problem: Given a bipartite graph G = (V1, V2; E), where the maximum degree of vertices in V2 is 4, can G be embedded on a t...