Results 221 to 230 of about 2,805,373 (250)
Some of the next articles are maybe not open access.

Scalable Graph Sampling on GPUs with Compressed Graph

Proceedings of the 31st ACM International Conference on Information & Knowledge Management, 2022
Hongbo Yin   +4 more
openaire   +1 more source

Random sampling in residual graphs

Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, 2002
Consider an n-vertex, m-edge, undirected graph with maximum flow value v. We give a new O(m+nv)-time maximum flow algorithm based on finding augmenting paths in random samples of the edges of residual graphs. After assigning certain special sampling probabilities to edges in O(m) time, our algorithm is very simple: repeatedly find an augmenting path in
David R. Karger, Matthew S. Levine
openaire   +2 more sources

Algorithms for the Sample Mean of Graphs

2009
Measures of central tendency for graphs are important for protoype construction, frequent substructure mining, and multiple alignment of protein structures. This contribution proposes subgradient-based methods for determining a sample mean of graphs. We assess the performance of the proposed algorithms in a comparative empirical study.
Brijnesh J. Jain, Klaus Obermayer
openaire   +1 more source

Sampling and Inference in a Population Graph

International Statistical Review / Revue Internationale de Statistique, 1980
Summary Graph models can be used in sample surveys utilizing a known or observable relational structure defined for pairs of units. This review paper gives an overview of some of the statistical inference problems which have been considered in connection with sampling from a population graph.
openaire   +1 more source

Sampling and Merging for Graph Anonymization

2016
We propose a method for network anonymization that consists on sampling a subset of vertices and merging its neighborhoods in the network. In such a way, by publishing the merged graph of the network together with the sampled vertices and their locally anonymized neighborhoods, we obtain a complete anonymized picture of the network.
openaire   +2 more sources

Half Sampling on Bipartite Graphs

Journal of Fourier Analysis and Applications, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

An adaptive graph sampling framework for graph analytics

Social Network Analysis and Mining, 2023
openaire   +1 more source

Graph Sampling

The American Statistician, 2023
openaire   +1 more source

Sampling Methods for Efficient Training of Graph Convolutional Networks: A Survey

IEEE/CAA Journal of Automatica Sinica, 2022
Mingyu Yan, Guoqi Li, Xiaochun Ye
exaly  

Preserving Minority Structures in Graph Sampling

IEEE Transactions on Visualization and Computer Graphics, 2021
Yitao Wu, Ying Zhao, Fangfang Zhou
exaly  

Home - About - Disclaimer - Privacy