Filters








40,610 Hits in 6.1 sec

Local Search for Group Closeness Maximization on Big Graphs [article]

Eugenio Angriman, Alexander van der Grinten, Henning Meyerhenke
2019 arXiv   pre-print
In this paper, we present new local search heuristics for group closeness maximization.  ...  to very big graphs yet.  ...  LOCAL SEARCH FOR GROUP CLOSENESS Let G = (V, E) be an undirected connected graph. We allow both unweighted and positively weighted graphs G. Subsets S ⊆ V are called groups.  ... 
arXiv:1911.03360v1 fatcat:cqerj377nngfpd6g6wm43y7vcq

Measuring and maximizing group closeness centrality over disk-resident graphs

Junzhou Zhao, John C.S. Lui, Don Towsley, Xiaohong Guan
2014 Proceedings of the 23rd International Conference on World Wide Web - WWW '14 Companion  
In this paper, we present a systematic solution for efficiently calculating and maximizing the group closeness for diskresident graphs.  ...  Experiments on real-world big graphs demonstrate the efficacy of our approach.  ...  Observations on Big Graphs In this section, we present patterns of node groups maximizing the group closeness on Livejournal and Twitter.  ... 
doi:10.1145/2567948.2579356 dblp:conf/www/ZhaoLTG14 fatcat:a3d5wxhrobgjpf6kulitg5jhfi

Pyntacle: a parallel computing-enabled framework for large-scale network biology analysis

Luca Parca, Mauro Truglio, Tommaso Biagini, Stefano Castellana, Francesco Petrizzelli, Daniele Capocefalo, Ferenc Jordán, Massimo Carella, Tommaso Mazza
2020 GigaScience  
Results We present Pyntacle, a high-performance framework designed to exploit parallel computing and graph theory to efficiently identify critical groups in big networks and in scenarios that cannot be  ...  to individual natural events or biological entities but that are often derived from group effects.  ...  ; Juliana Pereira for testing and constructive discussions; and to NVIDIA Corporation for supporting this research.  ... 
doi:10.1093/gigascience/giaa115 pmid:33084878 fatcat:kuq63lr5dnhhbo2q7fsizb674u

Billion-Node Graph Challenges

Yanghua Xiao, Bin Shao
2017 IEEE Data Engineering Bulletin  
The recent emergence of big graphs, especially those with billion nodes, poses great challenges for the effective management or mining of these big graphs.  ...  The article is closed with a brief discussion of open problems in billion-node graph management.  ...  For the online computation, it takes hours for the Dijkstra algorithm (on weighted graph) or bread-first search (on unweighted graphs) to find the shortest distance between two nodes [25] in a billion-node  ... 
dblp:journals/debu/XiaoS17 fatcat:jc3tzqfmhrd5xe5a64562drsaa

Distributed Search for Balanced Energy Consumption Spanning Trees in Wireless Sensor Networks

Andrei Gagarin, Sajid Hussain, Laurence T. Yang
2009 2009 International Conference on Advanced Information Networking and Applications Workshops  
The approach is a modification of Kruskal's minimum spanning tree (MST) search algorithm and is based on a distributed search by hierarchical clusters.  ...  We provide a new heuristic approach to search for balanced and small weight routing spanning trees in a network.  ...  And, if one of the intermediate nodes of degree 2 on the path fails, this could lead to a big data loss.  ... 
doi:10.1109/waina.2009.194 dblp:conf/aina/GagarinHY09 fatcat:opocg73vrfecjoo3kt7towlw3a

Characterization Theorems for Zara Graphs

A. Blokhuis, H. Wilbrink
1989 European journal of combinatorics (Print)  
We give several characterization theorems for Zara graphs. (b) 0(2n + I, 2)\0+ (2n, 2); (c) o+(2n, q)\P.l. 57 0195-6698/89/010057+ 12 $02.00/0  ...  For n ~ 5 we now can use Theorem 3 to finish the proof. For n ~ 4 we argue as follows. For every maximal clique M of r, the geometric lattice !f(M) is locally a projective space.  ...  A geodetically closed subspace Y i= X is called big if for all x EX\ Y there is a (necessarily unique) pointy E Y collinear with x; we shall say that y is the projection of x on Y and write y = Ily(x).  ... 
doi:10.1016/s0195-6698(89)80033-2 fatcat:5oakpg7ltbdwrfwjx3z3b74tpq

How to apply de Bruijn graphs to genome assembly

Phillip E C Compeau, Pavel A Pevzner, Glenn Tesler
2011 Nature Biotechnology  
e locality can be set-that is, tablets can be grouped based on types of edges (i.e., scan blue versus green edges)-to skip over data that is not relevant to the query.  ...  Here in the Computer and Information Sciences Research Group at NSA, we used this approach to demonstrate a breadth-rst search at brain scale, traversing more than 70 trillion edges on a 1 PB graph [24  ... 
doi:10.1038/nbt.2023 pmid:22068540 pmcid:PMC5531759 fatcat:yvbmxbd2pnbg5ojtaqggieuiia

Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness

Wojciech Nadara, Marcin Pilipczuk, Roman Rabinovich, Felix Reidl, Sebastian Siebertz, Marc Herbstritt
2018 Symposium on Experimental and Efficient Algorithms  
of this algorithm are close to optimal in graph classes with fixed excluded minor.  ...  On the theoretical side, we provide a new algorithm for uniform quasi-wideness with polynomial size guarantees in graph classes of bounded expansion and show a lower bound indicating that the guarantees  ...  However, the treewidth heuristic outperforms all approaches with proved guarantees for r = 5 on test sets up to the big group.  ... 
doi:10.4230/lipics.sea.2018.14 dblp:conf/wea/NadaraPRRS18 fatcat:rgg7eula4vc3nateu6opp3t34i

Common fate graph patterns in Monte Carlo Tree Search for computer go

Tobias Graf, Marco Platzner
2014 2014 IEEE Conference on Computational Intelligence and Games  
This is a tedious process which cannot be avoided as it leads to big improvements in playing strength.  ...  In Monte Carlo Tree Search often extra knowledge in form of patterns is used to guide the search and improve the playouts.  ...  We currently work on adapting the playouts based on the knowledge obtained in the tree-search. This is limited by the representation-capability of the features used in the playouts.  ... 
doi:10.1109/cig.2014.6932863 dblp:conf/cig/GrafP14 fatcat:47g4oolatncspfsh3ta5vzhdl4

A Survey of Community Search Over Big Graphs [article]

Yixiang Fang, Xin Huang, Lu Qin, Ying Zhang, Wenjie Zhang, Reynold Cheng, Xuemin Lin
2019 arXiv   pre-print
Recently a large group of research works, called community search, have been proposed. They aim to provide efficient solutions for searching high-quality communities from large networks in real-time.  ...  Consequently, how to efficiently find high-quality communities from big graphs is an important research topic in the era of big data.  ...  For other venues, we use full names. 36 Yixiang Fang et al.  ... 
arXiv:1904.12539v2 fatcat:swx7eervgbbgxpcf6znkx6cne4

LC-mine: a framework for frequent subgraph mining with local consistency techniques

Brahim Douar, Michel Liquiere, Chiraz Latiri, Yahya Slimani
2014 Knowledge and Information Systems  
LC-mine: a framework for frequent subgraph mining with local consistency techniques.  ...  Abstract Developing algorithms that discover all frequently occurring subgraphs in a large graph database is computationally extensive, as graph and subgraph isomorphisms play a key role throughout the  ...  The most general vertex group V l is the maximal vertex group of a given label l. Definition 5.3 (Vertex group support) Let V l be a vertex group in a graph database D.  ... 
doi:10.1007/s10115-014-0769-4 fatcat:5loij2mbabd47bbq5ff4j62yje

Fast Algorithms for Intimate-Core Group Search in Weighted Graphs [article]

Longxu Sun, Xin Huang, Rong-Hua Li, Jianliang Xu
2019 arXiv   pre-print
In this paper, we develop an efficient framework, called local exploration k-core search (LEKS), to find intimate-core groups in graphs.  ...  As one instance of community search, intimate-core group search over a weighted graph is to find a connected k-core containing all query nodes with the smallest group weight.  ...  Based on the k-core index, we develop a local exploration algorithm LEKS for intimate-core group search.  ... 
arXiv:1908.11788v1 fatcat:v7wevtbstjhftktvv7vruplc3q

Anytimeness avoids parameters in detecting closed convex polygons

Michael Zillich, Markus Vincze
2008 2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops  
longer, for finding closed convex polygons eliminates the need for parameter tuning.  ...  Many perceptual grouping algorithms depend on parameters one way or another.  ...  The local convexity graph constructed from visible lines and least cost neighbourhoods is planar and allows search for all convex polygonal chains in time O(n).  ... 
doi:10.1109/cvprw.2008.4562981 dblp:conf/cvpr/ZillichV08 fatcat:wtrv72dxm5gjbgm7d34sctblwa

Implementation issues of clique enumeration algorithm

Takeaki UNO
2012 Progress in Informatics  
Clique represents a densely connected structure in the graph, thus used to capture the local related elements such as clustering, frequent patterns, community mining, and so on.  ...  Recent applications have large scale very sparse graphs, thus efficient implementations for clique enumeration is necessary.  ...  We also thank to Zhiao Shi for bug reports. We also thank to Dr. Krister Swenson of University of Ottawa for giving an advice to improve the document.  ... 
doi:10.2201/niipi.2012.9.5 fatcat:vnwzuetm6jb6liggqb6zdq2oyi

BIG-ALIGN: Fast Bipartite Graph Alignment

Danai Koutra, Hanghang Tong, David Lubensky
2013 2013 IEEE 13th International Conference on Data Mining  
., the same or similar user) on LinkedIn for a user on Facebook? How can we effectively link an information network with a social network to support cross-network search?  ...  on real graphs. * Work done during an internship at IBM T.J.  ...  Government is authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation here on.  ... 
doi:10.1109/icdm.2013.152 dblp:conf/icdm/KoutraTL13 fatcat:emo56p2ryfgp3mt2b32k2w2lfq
« Previous Showing results 1 — 15 out of 40,610 results