352 search results - page 44 / 71 » Partitioning Graphs into Connected Parts |
CORR
2010
Springer
14 years 12 months ago
2010
Springer
Estimating characteristics of large graphs via sampling is a vital part of the study of complex networks. Current sampling methods such as (independent) random vertex and random w...
JCO
2010
14 years 10 months ago
2010
Given a network G = (V, E), we say that a subset of vertices S ⊆ V has radius r if it is spanned by a tree of depth at most r. We are interested in determining whether G has a cu...
IDA
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We propose a generic framework and methods for simplification of large networks. The methods can be used to improve the understandability of a given network, to complemen...
104
click to vote
GIS
2010
ACM
14 years 9 months ago
2010
ACM
Recording the location of people using location-acquisition technologies, such as GPS, allows generating life patterns, which associate people to places they frequently visit. Con...
WEA
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. In this paper we consider the problem of computing a minimum cycle basis of an undirected graph G = (V, E) with n vertices and m edges. We describe an efficient implement...