On Balanced Separators in Road Networks

نویسندگان

  • Aaron Schild
  • Christian Sommer
چکیده

The following algorithm partitions road networks surprisingly well: (i) sort the vertices by longitude (or latitude, or some linear combination) and (ii) compute the maximum flow from the first k nodes (forming the source) to the last k nodes (forming the sink). Return the corresponding minimum cut as an edge separator (or recurse until the resulting subgraphs are sufficiently small).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Balanced clusters and diffusion process in signed networks

In this paper we study the topology effects on diffusion process in signed networks. Considering a simple threshold model for diffusion process, it is extended to signed networks and some appropriate definitions are proposed. This model is a basic model that could be extended and applied in analyzing dynamics of many real phenomena such as opinion forming or innovation diffusion in social netwo...

متن کامل

Modeling and Hybrid Pareto Optimization of Cyclone Separators Using Group Method of Data Handling (GMDH) and Particle Swarm Optimization (PSO)

In present study, a three-step multi-objective optimization algorithm of cyclone separators is catered for the design objectives. First, the pressure drop (Dp) and collection efficiency (h) in a set of cyclone separators are numerically evaluated. Secondly, two meta models based on the evolved Group Method of Data Handling (GMDH) type neural networks are regarded to model the Dp and h as the re...

متن کامل

Using neural networks to predict road roughness

When a vehicle travels on a road, different parts of vehicle vibrate because of road roughness. This paper proposes a method to predict road roughness based on vertical acceleration using neural networks. To this end, first, the suspension system and road roughness are expressed mathematically. Then, the suspension system model will identified using neural networks. The results of this step sho...

متن کامل

Application of n-distance balanced graphs in distributing management and finding optimal logistical hubs

Optimization and reduction of costs in management of distribution and transportation of commodity are one of the main goals of many organizations. Using suitable models in supply chain in order to increase efficiency and appropriate location for support centers in logistical networks is highly important for planners and managers. Graph modeling can be used to analyze these problems and many oth...

متن کامل

On classes of graphs with strongly sublinear separators

For real numbers c, ε > 0, let Gc,ε denote the class of graphs G such that each subgraph H of G has a balanced separator of order at most c|V (H)|1−ε. A class G of graphs has strongly sublinear separators if G ⊆ Gc,ε for some c, ε > 0. We investigate properties of such graph classes, leading in particular to an approximate algorithm to determine membership in Gc,ε: there exist c > 0 such that f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015