This work presents a kernel method for clustering the nodes of a weighted, undirected, graph. The algorithm is based on a two-step procedure. First, the sigmoid commute-time kernel...
We investigate to what extent flooding and routing is possible if the graph is allowed to change unpredictably at each time step. We study what minimal requirements are necessary...
Social networks and collaborative tagging systems are rapidly gaining popularity as a primary means for storing and sharing data among friends, family, colleagues, or perfect stra...
Ralitsa Angelova, Marek Lipczak, Evangelos E. Mili...
The spectral approach for graph visualization computes the layout of a graph using certain eigenvectors of related matrices. Some important advantages of this approach are an abili...
This position paper advocates a possible bridging of multiple heterogeneous formats and interfaces for hypermedia data and metadata. Rather than one more text, bit-stream or proced...