We present k-Flipper, a graph transformation algorithm that transforms regular undirected graphs. Given a path of k +2 edges it interchanges the end vertices of the path. By defin...
Abstract. We consider a survivable network design problem known as the 2-NodeConnected Steiner Network Problem (2NCON): we are given a weighted undirected graph with a node partiti...
Markus Chimani, Maria Kandyba, Ivana Ljubic, Petra...
A novel technique to search for functional modules in a protein-protein interaction network is presented. The network is represented by the adjacency matrix associated with the und...
Background: Analyzing differential-gene-expression data in the context of protein-interaction networks (PINs) yields information on the functional cellular status. PINs can be for...
Alexander Platzer, Paul Perco, Arno Lukas, Bernd M...
Recent studies have shown that various models can explain the emergence of complex networks, such as scale-free and small-world networks. This paper presents a diļ¬erent model to...