26,255 Hits in 6.0 sec

Effective graph clustering for path queries in digital map databases

Yun-Wu Huang, Ning Jing, Elke A. Rundensteiner
1996 Proceedings of the fifth international conference on Information and knowledge management - CIKM '96  
In this paper, we present an experimental evaluation of graph clustering strategies in terms of their effectiveness in optimizing I/O for path query processing in digital map databases.  ...  Experimental evahration indicates that our SPC performs the best for the high-locality graphs (such as GIS maps), whereas the two-way partitioning approach performs the best for no-locality random graphs  ...  An intermodal map of both subway train and bus routes, however, exhibits high locality without planarity, therefore can be modeled by random graphs with high locality. 6 Experimental Evaluation In the  ... 
doi:10.1145/238355.238497 dblp:conf/cikm/HuangJR96 fatcat:vtilaxa6jnhvjgnxik2swvi6i4

Parallelizing Combinatorial Optimization Heuristics with GPUs

Mohammad Harun Rashid, Lixin Tao
2018 Advances in Science, Technology and Engineering Systems  
For performance evaluation, we've compared our experiment results with CPU based sequential solutions and all of our experimental evaluations show that parallelizing combinatorial optimization heuristics  ...  Our proposed work aims to design an efficient GPU framework for parallelizing optimization heuristics by focusing on the followings: distribution of data processing efficiently between GPU and CPU, efficient  ...  sequential meta-heuristics with extensive experimental design for graph bisection problem and TSP.  ... 
doi:10.25046/aj030635 fatcat:566v2rey2bgyhfrjqqjvdnpihq

Exploiting Reduction Rules and Data Structures: Local Search for Minimum Vertex Cover in Massive Graphs [article]

Yi Fan, Chengqian Li, Zongjie Ma, LjiLjana Brankovic, Vladimir Estivill-Castro, Abdul Sattar
2015 arXiv   pre-print
Experimental results on a wide range of real-word massive graphs show that our algorithm finds better covers than state-of-the-art local search algorithms for MinVC.  ...  Recently there has been great interest in solving this problem on real-world massive graphs. For such graphs, local search is a promising approach to finding optimal or near-optimal solutions.  ...  Experimental Evaluation In this section, we carry out extensive experiments to evaluate LinCom on massive graphs, compared against the stateof-the-art local search MinVC algorithm FastVC.  ... 
arXiv:1509.05870v1 fatcat:tyet7hxvsfgtpccflsqg7g7uqa

Graph Partitioning with Acyclicity Constraints

Orlando Moreira, Merten Popp, Christian Schulz, Marc Herbstritt
2017 Symposium on Experimental and Efficient Algorithms  
In this work, we show that this more constrained version of the graph partitioning problem is NP-complete and present heuristics that achieve a close approximation of the optimal solution found by an exhaustive  ...  search for small problem instances and much better scalability for larger instances.  ...  Experimental Evaluation In this section we evaluate the performance of our algorithms. We start by presenting methodology and the systems we use for the evaluation.  ... 
doi:10.4230/lipics.sea.2017.30 dblp:conf/wea/MoreiraPS17 fatcat:qmr5ihybprcgbnuo6mauzmwava

Optimizing path query performance: graph clustering strategies

Yun-Wu Huang, Ning Jing, Elke A. Rundensteiner
2000 Transportation Research Part C: Emerging Technologies  
Our experimental evaluation of the performance of these graph clustering techniques using an actual city road network as well as randomly generated graphs considers variations in parameters such as memory  ...  We nd that our SPC performs the best for the highly interconnected city map; the hybrid approach for random graphs with high locality; and the two-way partitioning based on link weights for random graphs  ...  This paper presents an extensive experimental evaluation of the comparative performance of the above six graph clustering techniques. Our experiments are based on three kinds of networks.  ... 
doi:10.1016/s0968-090x(00)00049-8 fatcat:lh22hu54qbeypjij2u2gg6qqxa

Memetic firefly algorithm for combinatorial optimization [article]

Iztok Fister Jr, Xin-She Yang, Iztok Fister, Janez Brest
2012 arXiv   pre-print
In this paper, we have been applied the firefly algorithm, hybridized with local search heuristic, to combinatorial optimization problems, where we use graph 3-coloring problems as test benchmarks.  ...  by coloring the suite of medium-scaled random graphs (graphs with 500 vertices) generated using the Culberson random graph generator.  ...  The heuristical swap local search After the evaluation step of the MFFA algorithm, the heuristical swap local search tries to improve the current solution.  ... 
arXiv:1204.5165v2 fatcat:hdefpkp2trh57dupsda22efhye

A Memetic Algorithm with Two Distinct Solution Representations for the Partition Graph Coloring Problem [chapter]

Petrica C. Pop, Bin Hu, Günther R. Raidl
2013 Lecture Notes in Computer Science  
In this paper we propose a memetic algorithm (MA) for the partition graph coloring problem.  ...  In our MA we use two distinct solution representations, one for the genetic operators and one for the local search procedure, which are tailored for the corresponding situations, respectively.  ...  Definition of the Partition Graph Coloring Problem Formally, the partition graph coloring problem is defined on an undirected graph G = (V, E) with the set of nodes V and the set of edges E.  ... 
doi:10.1007/978-3-642-53856-8_28 fatcat:ysfccdljdzekbjjpkfjvjl7kqa

Multiple Hungarian Method for k-Assignment Problem

Boštjan Gabrovšek, Tina Novak, Janez Povh, Darja Rupnik Poklukar and Janez Žerovnik
2020 Mathematics  
The k-assignment problem (or, the k-matching problem) on k-partite graphs is an NP-hard problem for k≥3. In this paper we introduce five new heuristics.  ...  Algorithm Dm can be considered as a greedy version of Bm, whereas Em and Fm are versions of local search algorithm, specialized for the k-matching problem.  ...  Acknowledgments: The authors wish to thank to three anonymous reviewers for a number of constructive comments that helped us to considerably improve the presentation.  ... 
doi:10.3390/math8112050 fatcat:nsciq6nhjnhttlgxnqnhljefri

A Hybrid Artificial Bee Colony Algorithm for Graph 3-Coloring [chapter]

Iztok Fister, Iztok Fister, Janez Brest
2012 Lecture Notes in Computer Science  
Extensive experimentations has shown that the HABC matched the competitive results of the best graph coloring algorithms, and did better than the traditional heuristics EA-SAW when solving equi-partite  ...  The Artificial Bee Colony (ABC) is the name of an optimization algorithm that was inspired by the intelligent behavior of a honey bee swarm.  ...  Influence of the local search During this experiment, the influence of hybridizing the ABC algorithm with a RWDE local search heuristic was observed.  ... 
doi:10.1007/978-3-642-29353-5_8 fatcat:cp24giijonbwjp4ned6mfswa7u

A Design of Genetic Algorithm-Based Meta-Heuristic Method

Kiyoharu TAGAWA, Kenji KANESIGE, Katsumi INOUE, Hiromasa HANEDA
1999 Transactions of the Society of Instrument and Control Engineers  
In this paper, a meta-heuristic method that combines the global search power of Genetic Algorithms with the local search power of local optimization algorithms is described.  ...  Finally, in order to get maximum efficiency of the meta-heuristic method, the best timing in employing the local optimization algorithms is discussed.  ...  Schevon: Optimization by simulated annealing: an experimental evaluation; part II, graph coloring and number partitioning, Operations Research, 39-3, 378/406 (1991) 10) D.R. Jones and M.A.  ... 
doi:10.9746/sicetr1965.35.1355 fatcat:bndjsrhxqrhi3anrjzj6nzwely

Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm

Iztok Fister, Marjan Mernik, Bogdan Filipič
2012 Computational optimization and applications  
This paper proposes a hybrid self-adaptive evolutionary algorithm for graph coloring that is hybridized with the following novel elements: heuristic genotype-phenotype mapping, a swap local search heuristic  ...  heuristic has on the evolutionary algorithm, and to show how graph structural features influence the performance of the graph-coloring algorithms.  ...  On the other hand, other local search heuristics include simulated annealing [13, 47] , iterative local search [16, 17] , reactive partial tabu search [4, 5, 54] , variable neighborhood search [2]  ... 
doi:10.1007/s10589-012-9496-5 fatcat:fie2yqfn4ngeli3zvv5knkzomq

Query Processing on Large Graphs: Approaches To Scalability and Response Time Trade Offs [article]

Soumyava Das, Abhishek Santra, Jay Bodra, Sharma Chakravarthy
2019 arXiv   pre-print
With the advent of social networks and the web, the graph sizes have grown too large to fit in main memory precipitating the need for alternative approaches for an efficient, scalable evaluation of queries  ...  An existing graph querying system has been extended to evaluate queries on partitioned graphs. Finally all approaches are contrasted.  ...  Experimental Analysis Experimental results presented in this section provide an analysis of the proposed heuristics and their validation for the OPAT query processing approach.  ... 
arXiv:1905.05384v1 fatcat:utjyeplk65dgdbx7jv4gdunwlm

Finding optimal solutions to the graph partitioning problem with heuristic search

Ariel Felner
2005 Annals of Mathematics and Artificial Intelligence  
Finally, we experimentally compare our approach to other states of the art graph partitioning optimal solvers on a number of classes of graphs.  ...  As search spaces become larger and as problems scale up, an efficient way to speed up the search is to use a more accurate heuristic function.  ...  Korf for suggesting the GPP as a candidate domain for advanced heuristics, for his preliminary ideas on such heuristics and for his helpful comments on this work.  ... 
doi:10.1007/s10472-005-9001-2 fatcat:iocz5v46dvc7fhbytw772ha2pm

Evolutionary Acyclic Graph Partitioning [article]

Orlando Moreira, Merten Popp, Christian Schulz
2017 arXiv   pre-print
This enables the utilization of graph partitioning algorithms for the problem of parallelizing computation for multiprocessor architectures.  ...  Here, we contribute a multi-level algorithm for the acyclic graph partitioning problem.  ...  Impact on Imaging Application We evaluate the impact of the improved partitioning heuristic on an advanced imaging algorithm, the Local Laplacian filter.  ... 
arXiv:1709.08563v1 fatcat:rlu45upobnbd3ekzc75mhzmgna

Graph Partitioning with Acyclicity Constraints [article]

Orlando Moreira, Merten Popp, Christian Schulz
2017 arXiv   pre-print
In this work, we show that this more constrained version of the graph partitioning problem is NP-complete and present heuristics that achieve a close approximation of the optimal solution found by an exhaustive  ...  search for small problem instances and much better scalability for larger instances.  ...  Experimental Evaluation In this section we evaluate the performance of our algorithms. We start by presenting methodology and the systems we use for the evaluation.  ... 
arXiv:1704.00705v1 fatcat:sd53ubbxtbgypjz5z32honpr5e
« Previous Showing results 1 — 15 out of 26,255 results