Filters








1,475 Hits in 5.9 sec

Finding a Concise, Precise, and Exhaustive Set of Near Bi-Cliques in Dynamic Graphs [article]

Hyeonjeong Shin, Taehyung Kwon, Neil Shah, Kijung Shin
2022 arXiv   pre-print
We also show successful applications of CutNPeel to graph compression and pattern discovery.  ...  A variety of tasks on dynamic graphs, including anomaly detection, community detection, compression, and graph understanding, have been formulated as problems of identifying constituent (near) bi-cliques  ...  Search Quality & Speed In this subsection, we compare the considered algorithms in terms of speed and the quality of output near bi-cliques.  ... 
arXiv:2110.14875v3 fatcat:eqzaqwrv2rf25da2fnk5sxozwa

Crowdsourcing computing resources for shortest-path computation

Alexandros Efentakis, Dimitris Theodorakis, Dieter Pfoser
2012 Proceedings of the 20th International Conference on Advances in Geographic Information Systems - SIGSPATIAL '12  
., involving users to collect data including the detection and assessment of changes to the road network graph, poses a challenge to shortest-path algorithms that rely on preprocessing.  ...  General Terms Algorithms  ...  FP7-PEOPLE-2010-ITN-264994) and "SimpleFleet" (http://www.simplefleet.eu, grant agreement No. FP7-ICT-2011-SME-DCL-296423).  ... 
doi:10.1145/2424321.2424383 dblp:conf/gis/EfentakisTP12 fatcat:qtek6fmefbexvaaui4juizokx4

Page 4354 of Mathematical Reviews Vol. , Issue 96g [page]

1996 Mathematical Reviews  
For the entire collection see MR 96d:68002. } 96g:68099 68R10 68Q20 Feder, Tomas (1-IBM2; San Jose, CA); Motwani, Rajeev (1-STF-C; Stanford, CA) Clique partitions, graph compression and speeding-up algorithms  ...  We then prove the existence of a partition of small total order in a suf- ficiently dense graph and devise an efficient algorithm to compute such a partition and the running time.  ... 

Maintaining dynamic minimum spanning trees: An experimental study

G. Cattaneo, P. Faruolo, U. Ferraro Petrillo, G.F. Italiano
2010 Discrete Applied Mathematics  
In particular, we have implemented and tested several variants of the polylogarithmic algorithm by Holm et al., sparsification on top of Frederickson's algorithm, and other (less sophisticated) dynamic  ...  We report our findings on an extensive empirical study on the performance of several algorithms for maintaining minimum spanning trees in dynamic graphs.  ...  Acknowledgements We are indebted to the anonymous referees for their useful and valuable comments.  ... 
doi:10.1016/j.dam.2009.10.005 fatcat:bnwt2vcodbahtp2mw4hz5erjsq

Maintaining Dynamic Minimum Spanning Trees: An Experimental Study [chapter]

Giuseppe Cattaneo, Pompeo Faruolo, Umberto Ferraro Petrillo, Giuseppe F. Italiano
2002 Lecture Notes in Computer Science  
In particular, we have implemented and tested several variants of the polylogarithmic algorithm by Holm et al., sparsification on top of Frederickson's algorithm, and other (less sophisticated) dynamic  ...  We report our findings on an extensive empirical study on the performance of several algorithms for maintaining minimum spanning trees in dynamic graphs.  ...  Acknowledgements We are indebted to the anonymous referees for their useful and valuable comments.  ... 
doi:10.1007/3-540-45643-0_9 fatcat:szax3vv2sfaztpxdpjqbmohxsi

Exploring Parallelism in Learning Belief Networks [article]

TongSheng Chu, Yang Xiang
2013 arXiv   pre-print
An algorithm is proposed to decompose the learning task for parallel processing. A further task decomposition is used to balance load among processors and to increase the speed-up and efficiency.  ...  We study how to use parallelism to tackle the increased complexity in learning such models and to speed up learning in large domains.  ...  Acknowledgements This work is supported by grants OGP0155425, CRD193296 from the Natural Sciences and Engineer ing Research Council of Canada, and by the Institute for Robotics and Intelligent Systems  ... 
arXiv:1302.1529v1 fatcat:6noswrlpf5f6xpqrybfpeuqcxm

Iterative compression and exact algorithms

Fedor V. Fomin, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Saket Saurabh
2010 Theoretical Computer Science  
We exemplify our findings with algorithms for the Maximum Independent Set problem, a parameterized and a counting version of d-Hitting Set and the Maximum Induced Cluster Subgraph problem.  ...  Iterative Compression has recently led to a number of breakthroughs in parameterized complexity.  ...  smaller than 2 |H | , and in this case we can speed up the algorithm.  ... 
doi:10.1016/j.tcs.2009.11.012 fatcat:xgs4a57pcbhhnkqrmlg3l2eata

Homology Computation of Large Point Clouds using Quantum Annealing [article]

Raouf Dridi, Hedayat Alghassi
2016 arXiv   pre-print
It uses quantum annealing to compute a clique covering of the graph and then uses this cover to construct a Mayer-Vietoris complex.  ...  We have introduced three different clique coverings and their quantum annealing formulation. Our pipeline scales polynomially in the size of the data, once the covering step is solved.  ...  Oberoi and P. Ronagh for helpful discussions on the topic, and M. Bucyk for proof reading the manuscript.  ... 
arXiv:1512.09328v3 fatcat:pvx6jnwtkvds3lbrv4d6iif5le

Speeding up algorithms on compressed web graphs

Chinmay Karande, Kumar Chellapilla, Reid Andersen
2009 Proceedings of the Second ACM International Conference on Web Search and Data Mining - WSDM '09  
Similar speed-ups have been obtained previously for classical graph algorithms like shortest paths and maximum bipartite matching.  ...  We measure the performance of our modified algorithms on several publicly available web graph datasets, and demonstrate significant empirical speedups that nearly match the compression ratios.  ...  Motwani and Feder [10] showed that several classical graph algorithms can be sped up using a similar type of virtual node compression, in which an undirected clique is transformed into a star.  ... 
doi:10.1145/1498759.1498836 dblp:conf/wsdm/KarandeCA09 fatcat:zlmxgi5aurgsdmpjt7o2r3tqny

Speeding up Networks Mining via Neighborhood Diversity

Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno, Ryuhei Uehara, Giuseppe Prencipe, Martin Farach-Colton
2020 Fun with Algorithms  
Then it has also been used as a tool to speed up algorithms for tractable problems.  ...  However, the proposed novel algorithms allow to improve the computational complexity from a time O(f(mw)⋅ n +m) - where n and m denote, respectively, the number of vertices and edges in the input graph  ...  In particular, parameterized algorithms have been recently proposed as a tool to speed up algorithms for problems in P [12] .  ... 
doi:10.4230/lipics.fun.2021.21 dblp:conf/fun/CordascoGR21 fatcat:anksnea2hjezplia4w7ekqjocm

Hashing for Adaptive Real-Time Graph Stream Classification With Concept Drifts

Lianhua Chi, Bin Li, Xingquan Zhu, Shirui Pan, Ling Chen
2018 IEEE Transactions on Cybernetics  
The proposed method substantially speeds up the graph feature extraction and avoids unbounded graph feature growth. Moreover, it effectively offsets concept drifts in graph stream classification.  ...  We partition the unbounded graph stream data into consecutive graph chunks, each consisting of a fixed number of graphs and delivering a corresponding chunk-level classifier.  ...  Accordingly, we employed two hashing schemes to speed up the graph feature extraction, and combined incremental stochastic learning strategy and chunk level weighting mechanism for graph stream classification  ... 
doi:10.1109/tcyb.2017.2708979 pmid:28858820 fatcat:youvqu7zpzh6pchrx4t5r4zgju

An Updated Experimental Evaluation of Graph Bipartization Methods [article]

Timothy D. Goodrich, Eric Horton, Blair D. Sullivan
2021 arXiv   pre-print
We assemble a preprocessing suite of fast input reduction routines from the Odd Cycle Transversal (OCT) and Vertex Cover (VC) literature, and compare algorithm implementations using Quadratic Unconstrained  ...  Finally, we provide all code and data in an open source suite, including a Python API for accessing reduction routines and branching algorithms, along with scripts for fully replicating our results.  ...  Algorithms such as VC branch-and-reduce can be CPU-parallelized on a shared-memory system to potentially obtain super-linear speed-ups (witnessed by CPLEX in Appendix C).  ... 
arXiv:1805.01041v4 fatcat:iyhfmqnzkbbn5lfkfal227qzbm

Distributed Arboricity-Dependent Graph Coloring via All-to-All Communication

Mohsen Ghaffari, Ali Sayyadi, Michael Wagner
2019 International Colloquium on Automata, Languages and Programming  
We present a constant-time randomized distributed algorithms in the congested clique model that computes an O(α)-vertex-coloring, with high probability.  ...  We also explain that a similar method can provide a constant-time randomized algorithm for decomposing the graph into O(α) edge-disjoint forests, so long as α ≤ n 1−o(1) .  ...  A topology-gathering procedure which allows us to exponentially speed up some LOCAL model algorithms, on sparse graphs and up to a small locality bound [16, 8] . 3.  ... 
doi:10.4230/lipics.icalp.2019.142 dblp:conf/icalp/GhaffariS19 fatcat:wwze4ixqnfhmnopzqz7hs5dpia

Engineering Data Reduction for Nested Dissection [article]

Wolfgang Ost, Christian Schulz, Darren Strash
2020 arXiv   pre-print
Many applications rely on time-intensive matrix operations, such as factorization, which can be sped up significantly for large sparse matrices by interpreting the matrix as a sparse graph and computing  ...  By applying both new and existing data reduction rules exhaustively before nested dissection, we obtain improved quality and at the same time large improvements in running time on a variety of instances  ...  speed up in the preprocessing time of such algorithms [22, 32] .  ... 
arXiv:2004.11315v1 fatcat:ceirz26xubguff77jzpna52c4a

Distributed subgraph matching on timely dataflow

Longbin Lai, Wenjie Zhang, Ying Zhang, Zhengping Qian, Jingren Zhou, Zhu Qing, Zhengyi Yang, Xin Jin, Zhengmin Lai, Ran Wang, Kongzhang Hao, Xuemin Lin (+1 others)
2019 Proceedings of the VLDB Endowment  
In this paper, we identify four strategies and three general-purpose optimizations from representative state-of-the-art algorithms.  ...  Our implementation covers all representative algorithms.  ...  Ying Zhang is supported by FT170100128 and DP180103096.  ... 
doi:10.14778/3339490.3339494 fatcat:ln7xhyl5h5g2fa6pjbpe5gfseu
« Previous Showing results 1 — 15 out of 1,475 results