Filters








9,138 Hits in 5.9 sec

Coupling-aware graph partitioning algorithms: Preliminary study

Maria Predari, Aurelien Esnard
2014 2014 21st International Conference on High Performance Computing (HiPC)  
In this paper, we present graph partitioning techniques, called co-partitioning, that address the problem of load balancing for two coupled codes: the key idea is to perform a "coupling-aware" partitioning  ...  Finally, we present a preliminary experimental study which compares our methods against the usual approach.  ...  Therefore we propose graph partitioning algorithms that take into consideration the coupling phase and perform a coupling-aware partitioning of the whole application; we call them co-partitioning.  ... 
doi:10.1109/hipc.2014.7116879 dblp:conf/hipc/PredariE14 fatcat:e74w7zvtwngfbmsepsemgn4bvi

Broadcasting in geometric radio networks

Anders Dessmark, Andrzej Pelc
2007 Journal of Discrete Algorithms  
Our results show sharp contrasts between the efficiency of broadcasting in geometric radio networks as compared to broadcasting in arbitrary graphs.  ...  Efficiency of broadcasting is influenced by knowledge radius, knowledge of individual positions when knowledge radius is zero, and awareness of collisions.  ...  The modified version of Algorithm Elect-and-Broadcast, called Algorithm Modified-Elect-and-Broadcast, consists of replacing Procedure Elect-Couple by Procedure Modified-Elect-Couple, for the partition  ... 
doi:10.1016/j.jda.2006.07.001 fatcat:suogandluvh6jdi7c2ohcmcg3e

Connection Scan Algorithm [article]

Julian Dibbelt, Thomas Pajor, Ben Strasser, Dorothea Wagner
2017 arXiv   pre-print
We study several problem variations such as the earliest arrival and profile problems.  ...  We introduce the Connection Scan Algorithm (CSA) to efficiently answer queries to timetable information systems.  ...  The preprocessing step consists of computing an l-level partition with k children where l and k are tuning parameters of the algorithm. We perform the partitioning using a graph partitioner.  ... 
arXiv:1703.05997v1 fatcat:zpk6yoyringi3diunskgpg5tx4

Midpoint routing algorithms for Delaunay triangulations

Weisheng Si, Albert Y. Zomaya
2010 2010 IEEE International Symposium on Parallel & Distributed Processing (IPDPS)  
For example, for many instances from Walshaw's benchmark collection we improve the best known partitioning. We use the well known framework of multi-level graph partitioning.  ...  This paper gives two new MOR algorithms for a class of geometric graphs called Delaunay triangulations (DTs): the Midpoint Routing algorithm and the Compass Midpoint algorithm.  ...  Parallel External Memory Graph Algorithms Abstract In this paper, we study parallel I/O efficient graph algorithms in the Parallel External Memory (PEM) model, one of the private-cache chip multiprocessor  ... 
doi:10.1109/ipdps.2010.5470471 dblp:conf/ipps/SiZ10 fatcat:yuchdc4zp5borm5vs7j4rqgmzy

Engineering planar separator algorithms

Martin Holzer, Frank Schulz, Dorothea Wagner, Grigorios Prasinos, Christos Zaroliagis
2009 ACM Journal of Experimental Algorithmics  
In this article, we present a comprehensive experimental study of the classical algorithms applied to a large variety of graphs, where our main goal is to find separators that do not only satisfy upper  ...  We consider classical linear-time planar separator algorithms, determining for a given planar graph a small subset of its nodes whose removal divides the graph into two components of similar size.  ...  Our Contribution Although the classical algorithms by Lipton and Tarjan [1979] and Djidjev [1982] have been known for quite some time, we are not aware of any systematic experimental study investigating  ... 
doi:10.1145/1498698.1571635 fatcat:zjh4ez3d5jdephi2sqdn76jwiq

Engineering Planar Separator Algorithms [chapter]

Martin Holzer, Grigorios Prasinos, Frank Schulz, Dorothea Wagner, Christos Zaroliagis
2005 Lecture Notes in Computer Science  
In this article, we present a comprehensive experimental study of the classical algorithms applied to a large variety of graphs, where our main goal is to find separators that do not only satisfy upper  ...  We consider classical linear-time planar separator algorithms, determining for a given planar graph a small subset of its nodes whose removal divides the graph into two components of similar size.  ...  Our Contribution Although the classical algorithms by Lipton and Tarjan [1979] and Djidjev [1982] have been known for quite some time, we are not aware of any systematic experimental study investigating  ... 
doi:10.1007/11561071_56 fatcat:bnli6phmxffyrpliq4cvowylla

Algorithms for hard-constraint point processes via discretization [article]

Tobias Friedrich, Andreas Göbel, Maximilian Katzmann, Martin S. Krejca, Marcus Pappik
2022 arXiv   pre-print
We study algorithmic applications of a natural discretization for the hard-sphere model and the Widom-Rowlinson model in a region 𝕍⊂ℝ^d.  ...  We give sufficient conditions that the partition function of a discrete hard-core model on a geometric graph based on a point set X ⊂𝕍 closely approximates those of such continuous models.  ...  However, in contrast to the discrete setting, we are not aware of any method to compute the coefficients of the expansion efficiently for continuous problems, which would be required for algorithmic application  ... 
arXiv:2107.08848v2 fatcat:wru2kovsjfdqxdfwbd5dgioxxu

Approximation Algorithms for Finding Maximum Induced Expanders [article]

Shayan Oveis Gharan, Alireza Rezaei
2015 arXiv   pre-print
We initiate the study of approximating the largest induced expander in a given graph G.  ...  We expect to see further applications of our SDP relaxation in graph partitioning problems.  ...  The problem is extensively studied in the last couple of years because of its close connection to the unique games problem [RST10, BFK + 11, OT12, KL12] .  ... 
arXiv:1511.02786v1 fatcat:tumbiyzbcbdwhgf7olenkenvjy

Sublinear Algorithms for Hierarchical Clustering [article]

Arpit Agarwal, Sanjeev Khanna, Huan Li, Prathamesh Patil
2022 arXiv   pre-print
graph edges are partitioned over several machines connected via a communication channel.  ...  The focus of this work is to study hierarchical clustering for massive graphs under three well-studied models of sublinear computation which focus on space, time, and communication, respectively, as the  ...  However, we are not aware of such an algorithm for this objective.  ... 
arXiv:2206.07633v1 fatcat:krqszwfpnbfjnny6xflkm5erai

Characterizing Thermal Energy Consumption through Exploratory Data Mining Algorithms

Tania Cerquitelli, Evelina Di Corso
2016 International Conference on Extending Database Technology  
First, a partitional clustering algorithm is applied to weather conditions to discover groups of thermal energy consumption that occurred in similar weather conditions.  ...  FARTEC exploits a joint approach coupling cluster analysis and association rules.  ...  FARTEC integrates a partitional algorithm, the K-means algorithm [8] , to subdivide the input dataset into K groups, where K is defined by the user and each object is assigned to a single cluster.  ... 
dblp:conf/edbt/CerquitelliC16 fatcat:untwnpkvsfem5axkojfwe7ry3a

Heuristic algorithms and learning techniques: applications to the graph coloring problem

Daniel Cosmin Porumbel
2011 4OR  
Indeed, we are not aware of previous graph coloring algorithms presenting a mutation operator with a very positive effect on performance.  ...  One should also be aware that other hypothesis from the literature can be easily rejected for graph coloring.  ...  A coloring is a particular case of a partition, and so, the partition distance has often been used for graph coloring.  ... 
doi:10.1007/s10288-011-0193-5 fatcat:nihv44ivizh3fgo7vwo2kynwka

Dynamic Algorithms for Graph Coloring [article]

Sayan Bhattacharya and Deeparnab Chakrabarty and Monika Henzinger and Danupon Nanongkai
2017 arXiv   pre-print
We design fast dynamic algorithms for proper vertex and edge colorings in a graph undergoing edge insertions and deletions.  ...  In the static setting, there are simple linear time algorithms for (Δ+1)- vertex coloring and (2Δ-1)-edge coloring in a graph with maximum degree Δ.  ...  There is a randomized, fully dynamic algorithm to maintain a ∆ + 1 vertex coloring of a graph whose maximum degree is ∆ with expected amortized update time O(log ∆). Preliminaries.  ... 
arXiv:1711.04355v1 fatcat:fp2ddit4drbxhfoheeavgln5fy

Resource-Aware Algorithms for Distributed Loop Closure Detection with Provable Performance Guarantees [article]

Yulun Tian, Kasra Khosoussi, Jonathan P. How
2019 arXiv   pre-print
This paper presents resource-aware algorithms for distributed inter-robot loop closure detection.  ...  We demonstrate that this problem is in general NP-hard, and present efficient approximation algorithms with provable performance guarantees.  ...  The set of potential loop closures identified from metadata exchange can be naturally represented using an r-partite exchange graph [10, 29] . Definition 1 (Exchange Graph ).  ... 
arXiv:1901.05925v1 fatcat:gz4yjasjn5fmrjbvvbnsf65yoq

A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms

Andreas Emil Feldmann, Karthik C. S., Euiwoong Lee, Pasin Manurangsi
2020 Algorithms  
We survey developments in the area both from the algorithmic and hardness perspectives, with emphasis on new techniques and potential future research directions.  ...  There are a lot more interesting graph classes F studied in structural and algorithmic graph theory.  ...  We discuss a couple such problems below. Min k-Uncovered.  ... 
doi:10.3390/a13060146 fatcat:2u2vv3uksfguvj6473t2gsq42a

Algorithms and Complexity [chapter]

Peter Brucker, Sigrid Knust
2011 Complex Scheduling  
They study the placement of linear computations onto reconfigurable arrays. Another line of work is related to the design of fault-tolerant or power-aware mapppings for embedded systems.  ...  Distributed-memory parallel computing platforms pose many challenges to the algorithm designer and the programmer.  ...  For a fork graph, it is natural to map any partition of the graph onto the processors. Assume such a partition with q sets, where q ≤ p.  ... 
doi:10.1007/978-3-642-23929-8_2 fatcat:efxs6lrvbvfuvocbrelyqdpyma
« Previous Showing results 1 — 15 out of 9,138 results