Results 271 to 280 of about 35,638 (292)
Some of the next articles are maybe not open access.
On Partitioning Program Graphs
IEEE Transactions on Software Engineering, 1977In recent years, applications of graph theory to computer software have given fruitful results and attracted more and more attention. A program graph is a graph structural model of a program exhibiting the flow relation or connection among the elements (statements) in the program.
openaire +2 more sources
Proceedings of the VLDB Endowment, 2018
Graph partitioning is an essential yet challenging task for massive graph analysis in distributed computing. Common graph partitioning methods scan the complete graph to obtain structural characteristics offline, before partitioning. However, the emerging need for low-latency, continuous graph analysis led to the development of online partitioning ...
Zainab Abbas +3 more
openaire +1 more source
Graph partitioning is an essential yet challenging task for massive graph analysis in distributed computing. Common graph partitioning methods scan the complete graph to obtain structural characteristics offline, before partitioning. However, the emerging need for low-latency, continuous graph analysis led to the development of online partitioning ...
Zainab Abbas +3 more
openaire +1 more source
Hierarchical graph partitioning
Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures, 2014One of the important optimization questions in highly parallel systems is the problem of assigning computational resources to communicating tasks. While scheduling tasks/operators, tasks assigned to nearby resources (e.g. on the same CPU core) have low communication costs, whereas tasks assigned to distant resources (e.g.
Mohammadtaghi Hajiaghayi +3 more
openaire +1 more source
Restreaming graph partitioning
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining, 2013Partitioning large graphs is difficult, especially when performed in the limited models of computation afforded to modern large scale computing systems. In this work we introduce restreaming graph partitioning and develop algorithms that scale similarly to streaming partitioning algorithms yet empirically perform as well as fully offline algorithms. In
Joel Nishimura, Johan Ugander
openaire +1 more source
Canadian Mathematical Bulletin, 1968
In 1879 Kempe [5] presented what has become the most famous of all incorrect proofs of the Four Colour Conjecture, but even though his proof was erroneous his method has become quite useful. In 1890 Heawood [4] was able to modify Kempe's method to establish the Five Colour Theorem for planar graphs.
openaire +2 more sources
In 1879 Kempe [5] presented what has become the most famous of all incorrect proofs of the Four Colour Conjecture, but even though his proof was erroneous his method has become quite useful. In 1890 Heawood [4] was able to modify Kempe's method to establish the Five Colour Theorem for planar graphs.
openaire +2 more sources
On Partitional Labelings of Graphs
Mathematics in Computer Science, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ichishima, Rikio, Oshima, Akito
openaire +2 more sources
Fast Approximate Graph Partitioning Algorithms
SIAM Journal on Computing, 1999Summary: We study graph partitioning problems on graphs with edge capacities and vertex weights. The problems of \(b\)-balanced cuts and k-balanced partitions are unified into a new problem called minimum capacity \(\rho\)-separators. A \(\rho\)-separator is a subset of edges whose removal partitions the vertex set into connected components such that ...
Even, Guy +3 more
openaire +1 more source
2017
The analysis of large graph plays a prominent role in various fields of research and application area. Initially, we formally define the partitioning scheme based on user needs and requirements. In this paper, we will be dealing with various methods of graph partitioning, its advantages and disadvantages, and from the result we can conclude which is ...
Prabhu Dessai Tanvi +2 more
openaire +1 more source
The analysis of large graph plays a prominent role in various fields of research and application area. Initially, we formally define the partitioning scheme based on user needs and requirements. In this paper, we will be dealing with various methods of graph partitioning, its advantages and disadvantages, and from the result we can conclude which is ...
Prabhu Dessai Tanvi +2 more
openaire +1 more source
Mathematical Notes, 2006
We prove that the set of vertices V, |V| = rk, of a connected graph G can be split into r subsets of the same cardinality in such a way that the distance between any vertex of G and any subset of the partition is at most r.
openaire +1 more source
We prove that the set of vertices V, |V| = rk, of a connected graph G can be split into r subsets of the same cardinality in such a way that the distance between any vertex of G and any subset of the partition is at most r.
openaire +1 more source
Distant Vertex Partitions of Graphs
Combinatorics, Probability and Computing, 1998We consider the function χ(Gk), defined to be the smallest number of colours that can colour a graph G in such a way that no vertices of distance at most k receive the same colour. In particular we shall look at how small a value this function can take in terms of the order and diameter of G. We get general bounds for this and tight bounds for
openaire +1 more source