Filters








70,724 Hits in 4.8 sec

Incrementalization of graph partitioning algorithms

Wenfei Fan, Muyang Liu, Chao Tian, Ruiqi Xu, Jingren Zhou
2020 Proceedings of the VLDB Endowment  
This paper studies incremental graph partitioning.  ...  We approach this by proposing to incrementalize widely-used graph partitioners A into heuristically-bounded incremental algorithms A∆.  ...  We compute a partition C(G) of graph G once with a batch algorithm C (a.k.a. partitioner).  ... 
doi:10.14778/3389133.3389142 fatcat:itwgevngkfcalng2zn6vf7wlci

Genetic algorithms for graph partitioning and incremental graph partitioning

H. Maini, K. Mehrotra, C. Mohan, S. Ranka
Proceedings of Supercomputing '94  
We also extend our algorithm to Incremental Graph Partitioning problems, in which the graph structure or system properties changes with time.  ...  This paper presents genetic algorithms for suboptimal graph partitioning, with new crossover operators (KNUX, DKNUX) that lead to orders of magnitude improvement over traditional genetic operators in solution  ...  Use of prior information to improve solutions. 2. E cient partitioning of graphs to which incremental updates are made. 3. Parallelizability, using a distributed genetic algorithm model. 4 .  ... 
doi:10.1109/superc.1994.344308 dblp:conf/sc/MainiMMR94 fatcat:stwawbxlhzdmlascwtlesnmltu

Accelerate Incremental TSP Algorithms on Time Evolving Graphs with Partitioning Methods

Shalini Sharma, Jerry Chou
2022 Algorithms  
We addressed this issue for the traveling salesman problem (TSP) in our previous work and proposed an incremental algorithm where the TSP tour is computed from the previous result instead of the whole  ...  We have also examined the effect of increasing the number of partitions on the total computation time.  ...  Data Availability Statement: All the graphs were synthetically generated. No external dataset has been used. Conflicts of Interest: The authors declare no conflict of interest.  ... 
doi:10.3390/a15020064 fatcat:gg4r7ye4qndo7itss6yg3c2xw4

Artificial Intelligence Knowledge Graph for Dynamic Networks: An Incremental Partition Algorithm

Yonglin Leng, Hongmin Wang, FuYu Lu
2020 IEEE Access  
Second, IPID devises the initial and incremental partitioning algorithms of RDF. The initial partition divides the original RDF graph into kernel vertices, boundary vertices and free vertices.  ...  Meanwhile, the incremental partition algorithm would also execute a dynamic adjustment strategy at a certain time interval according to the balance and tightness of sub-partition to satisfy the partitioning  ...  initial and incremental graph partitioning algorithms under the mixed object function.  ... 
doi:10.1109/access.2020.2982652 fatcat:gw4glivjlbbdfp62l6scx4fnqe

Empowering Fast Incremental Computation over Large Scale Dynamic Graphs

Charith Wickramaarachchi, Charalampos Chelmis, Viktor K. Prasanna
2015 2015 IEEE International Parallel and Distributed Processing Symposium Workshop  
It also enables incremental processing of dynamic graphs by automatically executing user composed static graph algorithms in an incremental manner.  ...  Our model allows users to easily compose static graph algorithms similar to the widely used vertex-centric model.  ...  of static graph computation and more importantly that of incremental computation over dynamic graphs.  ... 
doi:10.1109/ipdpsw.2015.136 dblp:conf/ipps/Wickramaarachchi15 fatcat:v7v6w7qfmreepfzxnwu6z4hw7m

Incremental Graph Partitioning Based on MapReduce

An-ming JI, Feng-lan LI, Song-chang JIN, Shu-qiang YANG
2017 DEStech Transactions on Computer Science and Engineering  
In this paper, we propose a distributed incremental graph partitioning algorithm to partition the incremental Graphs into smaller components with Hadoop.  ...  Graph partitioning is widely used in many diverse domains. Incremental graph is a member of Graph which evolves with time.  ...  The author is grateful to the anonymous referee for a careful checking of the details and helpful comments that improved this paper.  ... 
doi:10.12783/dtcse/mcsse2016/10958 fatcat:wjcd3lh4sred7ccm2fwpdcn4ae

An Incremental Bisimulation Algorithm [chapter]

Diptikalyan Saha
2007 Lecture Notes in Computer Science  
In this paper we present the first algorithm for incremental maintenance of maximum bisimulation relation of a graph with respect to changes in the graph.  ...  the fastest available non-incremental algorithm.  ...  Manjari for their comments to improve the quality of this paper. We are also grateful to Prof. C. R. Ramakrishnan and Dr. Subir Saha for encouraging this work.  ... 
doi:10.1007/978-3-540-77050-3_17 fatcat:3l454rp4zreknk5lgxkjxwtw5y

ITERATIVE STRUCTURE DISCOVERY IN GRAPH-BASED DATA

JEFFREY A. COBLE, RUNU RATHI, DIANE J. COOK, LAWRENCE B. HOLDER
2005 International journal on artificial intelligence tools  
We address incremental data mining by introducing a mechanism for summarizing discoveries from previous data increments so that the globally-best patterns can be computed by mining only the new data increment  ...  To address monolithic datasets we introduce a technique by which these datasets can be partitioned and mined serially with minimal impact on the result quality.  ...  Subdue does not have any information about the structure of its input graphs and therefore graph partitioning algorithms, like the multi-level Kerninghan-Lin algorithm 18 or the Fiduccia-Matheyses algorithm  ... 
doi:10.1142/s0218213005002016 fatcat:j3asngciq5bl3dwkjsg5gaxc5a

Parallel incremental graph partitioning

Chao-Wei Ou, S. Ranka
1997 IEEE Transactions on Parallel and Distributed Systems  
In incremental graph-partitioning problems the partitioning of the graph needs to be updated as the graph changes over time a small number of nodes or edges may be added or deleted at any g i v en instant  ...  Further, the quality of the partitioning achieved is comparable to that achieved by applying recursive spectral bisection to the incremental graphs from scratch.  ...  Figure 1 : The di erent steps used in our incremental graph-partitioning algorithm.  ... 
doi:10.1109/71.605773 fatcat:etuyobvkhjcp3eoq26luy3fqcy

Workload Aware Incremental Repartitioning of NoSQL for Online Transactional Processing Applications

Anagha Bhunje, Swati Ahirrao
2018 International Journal of Advances in Applied Sciences  
The work-load aware incremental repartitioning approach is used to balance the load among the partitions and to reduce the number of transactions that are distributed in nature.  ...  Tuple Classification and Migration Algorithm is used for mapping clusters to partitions and after that tuples are migrated efficiently.</span></p>  ...  The Graph Partitioning Algorithm is used to find the balanced partitions in order to reduce the number of distributed transactions. METIS tool is used to partition the graph.  ... 
doi:10.11591/ijaas.v7.i1.pp54-65 fatcat:ijhuit32erhsrdmddrbupwzqw4

Source Code Partitioning in Program Optimization

Murat Bolat, Kirk Kelsey, Xiaoming Li, Guang R. Gao
2011 2011 IEEE 17th International Conference on Parallel and Distributed Systems  
Partitioning of program functions by analyzing profiling output shows dramatic decrease in compilation time of programs.  ...  The main goal of this research is grouping or partitioning of closely related program functions into the same translation unit.  ...  PARTITIONING ALGORITHMS The memory reuse graph is divided using graph partitioning algorithms.  ... 
doi:10.1109/icpads.2011.125 dblp:conf/icpads/BolatKLG11 fatcat:ngr5mhlwzjf4zjfp7mltwdr6mu

A Multi-Objective Partition Method for Marine Sensor Networks Based on Degree of Event Correlation

Dongmei Huang, Chenyixuan Xu, Danfeng Zhao, Wei Song, Qi He
2017 Sensors  
Then, we construct a multi-objective balanced partition method to partition the abstract graph into multiple regions and store them in the cloud computing platform.  ...  On this basis, an incremental optimization strategy is designed to dynamically optimize existing partitions when new sensors are added into the network.  ...  Conflicts of Interest: The authors declare no conflict of interest.  ... 
doi:10.3390/s17102168 pmid:28934126 pmcid:PMC5677375 fatcat:p5bscamx7jcl3fea7tnpaxswdu

Incremental assignment problem

Ismail H. Toroslu, Göktürk Üçoluk
2007 Information Sciences  
In this problem, a new pair of vertices and their incident edges are added to a weighted bipartite graph whose maximum weighted matching is already known, and the maximum weighted matching of the extended  ...  We propose an O(|V | 2 ) algorithm for the problem.  ...  newer algorithms are not suitable for an incremental version of the problem.  ... 
doi:10.1016/j.ins.2006.05.004 fatcat:wibnbwooobdd7i3obnaekoifyy

Parallel incremental graph partitioning using linear programming

Chao Wei Ou, Sanjay Ranka
1994 Supercomputing, Proceedings  
In incremental graph-partitioning problems the partitioning of the graph needs to be updated as the graph changes over time; a small number of nodes or edges may be added or deleted at any given instant  ...  Further, the quality of the partitioning achieved is comparable to that achieved by applying recursive spectral bisection to the incremental graphs from scratch.  ...  Our incremental graph-partitioning algorithm uses linear programming.  ... 
doi:10.1145/602770.602849 fatcat:emujqduff5e5lgqyemttx4effq

Parallel incremental graph partitioning using linear programming

Chao Wei Ou, Sanjay Ranka
1994 Supercomputing, Proceedings  
In incremental graph-partitioning problems the partitioning of the graph needs to be updated as the graph changes over time; a small number of nodes or edges may be added or deleted at any given instant  ...  Further, the quality of the partitioning achieved is comparable to that achieved by applying recursive spectral bisection to the incremental graphs from scratch.  ...  Our incremental graph-partitioning algorithm uses linear programming.  ... 
doi:10.1145/602847.602849 fatcat:zyrxuqlx3fhntlfknu2kzgzhmu
« Previous Showing results 1 — 15 out of 70,724 results