Essays about: "Graf Partitionering"
Found 3 essays containing the words Graf Partitionering.
-
1. Near-linear time expander decomposition in practice
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : An expander decomposition is a partitioning of vertices such that each partition is an induced expander. Recently Saranurak and Wang [SW19] gave a randomized algorithm for computing expander decompositions in O(Ø-1m log4m) time. This was the first near linear time algorithm with respect to the number of edges m. READ MORE
-
2. WinBro: A Window and Broadcast-based Parallel Streaming Graph Partitioning Framework for Apache Flink
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : The past years have shown an increasing demand to process data of various kinds and size in real-time. A common representation for many real-world scenarios is a graph, which shows relations between entities, such as users of social networks or pages on the Internet. READ MORE
-
3. Scalable System-Wide Traffic Flow Predictions Using Graph Partitioning and Recurrent Neural Networks
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : Traffic flow predictions are an important part of an Intelligent Transportation System as the ability to forecast accurately the traffic conditions in a transportation system allows for proactive rather than reactive traffic control. Providing accurate real-time traffic predictions is a challenging problem because of the nonlinear and stochastic features of traffic flow. READ MORE
