301 search results - page 28 / 61 » Kronecker Graphs: An Approach to Modeling Networks |
CHARME
2001
Springer
14 years 9 days ago
2001
Springer
The framework of this paper is the formal specification and proof of applications distributed on symmetric interconnection networks, e.g. the torus or the hypercube. The algorithms...
DBSEC
2006
13 years 10 months ago
2006
Abstract. Attack graph is important in defending against well-orchestrated network intrusions. However, the current analysis of attack graphs requires an algorithm to be developed ...
EDBT
2012
ACM
11 years 11 months ago
2012
ACM
In this paper, we study how to find maximal k-edge-connected subgraphs from a large graph. k-edge-connected subgraphs can be used to capture closely related vertices, and findin...
HYBRID
2007
Springer
14 years 16 days ago
2007
Springer
Abstract. Nonlinearities and the lack of accurate quantitative information considerably hamper modeling and system analysis of biochemical networks. Here we propose a procedure for...
COR
2008
13 years 8 months ago
2008
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...