graph partitioning problem
Applying a Parallel Solution to the Graph Partitioning Problem in the Simulation of Multiphase Flows
... Abstract—The Graph Partitioning Problem (GPP) has several practical applications in many areas, such as design of VLSI (Very-large-scale integration) circuits, solution of numerical methods for ...
6
A two level graph partitioning problem arising in mobile wireless communications
... k-partition problem is an N P-hard combinatorial optimisation problem with many ...this problem, one having both node and edge variables, and the other having only edge ...
21
Using Graph Partitioning for Scalable Distributed Quantum Molecular Dynamics
... a graph partitioning problem studied in this ...of graph partitioning in order to efficiently parallelize these ...a graph representing the zero-nonzero structure of a ...
21
Unsupervised Semantic Role Induction with Graph Partitioning
... Like Grenager and Manning (2006) and Lang and Lapata (2010; 2011), this paper describes an unsupervised method for semantic role induction, i.e., one that does not require any role annotated data or additional semantic ...
12
RBSEP: a reassignment and buffer based streaming edge partitioning approach
... years, partitioning of large scale graphs has become a challenging issue and has absorbed many researchers’ ...interest. Graph partitioning is an NP-hard prob- lem, and often solved by edge-cut and ...
17
COBIT BENCHMARKING OF SYSTEM DEVELOPMENT GOVERNANCE FOR A GOVERNMENT AGENCY IN MALAYSIA
... the graph. The graph partitioning algorithm divides the nodes from the graph into k balanced partitions such that the number of edges crossing the partitions is ...This graph ...
11
Solving Digital Circuit Layout Problem based on Graph Partitioning Technique: A Glance
... circuit-partitioning problem Martin [32] proposed GAs technique as the singular value decomposition (SVD), This spectral technique has high running time and is suitable where the fitness function is ...
5
Incremental Graph Partitioning Based on MapReduce
... incremental graph partitioning ...streaming graph update events. Many popular graph processing platforms such as Pregel [12] that bases on MapReduce [12], and its open source cousin Apache ...
6
Similarity Driven Semantic Role Induction via Graph Partitioning
... a graph partitioning problem, whereby argument instances of a verb are represented as vertices in a graph whose edges express similarities between these ...The graph consists of ...
39
INVESTIGATION STUDY: AN INTENSIVE ANALYSIS FOR MSA LEADING METHODS
... At the beginning of the algorithm, the number of edges is | E |. The number of subgraphs is equal to one. After, the algorithm at each iteration eliminates a set of edges, and calculates the number of subgraphs. If this ...
10
Computing Word Senses by Semantic Mirroring and Spectral Graph Partitioning
... a graph is obtained that represents words and their translations from a paral- lel corpus or a bilingual ...the graph holds information about the different meanings of words that occur in the ...Spectral ...
5
Mapping for maximum performance on FPGA DSP blocks
... Abstract—The digital signal processing (DSP) blocks on modern field programmable gate arrays (FPGAs) are highly capable and support a variety of different datapath configurations. Unfortunately, inference in synthesis ...
15
Partitioning the Intrinsic Order Graph for Complex Stochastic Boolean Systems
... useful graph- ical representation of a CSBS is the intrinsic order graph ...this graph into smaller and smaller equal-sized ...the graph I n into totally or- dered subsets (chains) of the set ...
6
Clustering in Wireless Multimedia Sensor Networks Using Spectral Graph Partitioning
... In our proposed method, clustering of WMSN has been done by applying Spectral Graph Partitioning tech- nique [10] recursively. Each node sends short message to sink which contains the location information ...
6
Influence-based community partition for social networks
... a graph G, MODUA finds communities by optimizing the modularity score locally and it terminates until a maximal modularity score is ...a graph iteratively into K communities by minimizing the general cut ...
18
Text Categorization as a Graph Classification Problem
... The graph-of-words representation is designed to capture dependency between words, ...a graph has the advantage of be- ing linear in the number of edges, ...
11
Graph Regionalization with Clustering and Partitioning: an Application for Daily Commuting Flows in Albania
... The starting point is that, following Guo (2010, 2010a), spatial interactions naturally form a network/graph, where each node is a location (or area) and each link is an interaction between two nodes (location). ...
20
Fast Graph Partitioning Active Contours for Image Segmentation Using Histograms
... As highlighted in the previous section, an exact, rather than an approximate computation of the dissimilarity matrix W would lead to more consistent results during segmentation. For a better understanding in computing ...
9
Soft Computing Approach for digital Circuit Layout based on Graph Partitioning
... Simulated annealing [10] belongs to the class of non- deterministic algorithms. Kirkpatrik, Gelatt and Vecchi first introduced this heuristic in 1983. Simulated Annealing (SA) is a general iterative improvement algorithm ...
5
Clustering Optimal Algorithm- A Survey
... The focus of the paper is only on the clustering techniques. Clustering is the process of grouping the data according to some criteria that most similar data to form a cluster. The groups are not predefined in ...
7