820 search results - page 30 / 164 » Inducing Temporal Graphs |
CORR
2011
Springer
13 years 3 months ago
2011
Springer
Abstract. Most instruments - formalisms, concepts, and metrics for social networks analysis fail to capture their dynamics. Typical systems exhibit different scales of dynamics, ra...
ERSA
2006
2006
GifT: A Gravity-Directed and Life-Time Based Algorithm for Temporal Partitioning of Data Flow Graphs
13 years 9 months ago
In reconfigurable systems, reconfiguration latency has a significant impact on the system performance. In this work, a temporal partitioning algorithm is presented to partition da...
ICDM
2007
IEEE
14 years 2 months ago
2007
IEEE
ASALSAN is a new algorithm for computing three-way DEDICOM, which is a linear algebra model for analyzing intrinsically asymmetric relationships, such as trade among nations or th...
GD
2007
Springer
14 years 2 months ago
2007
Springer
We propose a layout algorithm for micro/macro graphs, i.e. relational structures with two levels of detail. While the micro-level graph is given, the macro-level graph is induced b...
SIAMDM
2008
13 years 8 months ago
2008
A graph G is strict quasi parity (SQP) if every induced subgraph of G that is not a clique contains a pair of vertices with no odd chordless path between them (an even pair). Houga...