The paper describes our approach for the Authorship Identification task at the PAN CLEF 2015. We extract textual patterns based on features obtained from shortest path walks over Integrated Syntactic Graphs (ISG). Then we calculate a similarity between the unknown document and the known document with these patterns. The approach uses a predefined threshold in order to decide if the unknown docu...

Abraham et al. [SODA 2010] have recently presented a theoretical analysis of several practical point-to-point shortest path algorithms based on modeling road networks as graphs with low highway dimension. They also analyze a labeling algorithm. While no practical implementation of this algorithm existed, it has the best time bounds. This paper describes an implementation of the labeling algorit...

We study the combinatorial properties of optimal refueling policies, which specify the transportation paths and the refueling operations along the paths to minimize the total transportation costs between vertices. The insight into the structure of optimal refueling policies leads to an elegant reduction of the problem of finding optimal refueling policies into the classical shortest path proble...

In this paper, we propose a combination of pedestrian data collection and analysis and modeling that may yield higher competitive advantage in the business environment. The data collection is only based on simple inventory and questionnaire surveys on a hypermarket to obtain trajectory path of pedestrian movement. Though the data has limitation by using static trajectories, our techniques showe...

For oversized cargo transportation, traditional transportation schemes only consider road length, road width, the transportation cost as weight values in analysis and calculation of route selection. However, for oversized trucks, turning direction at road intersections is also a factor worth considering. By introducing the classical algorithm of Dijkstra into the model of road network, this res...

The shortest path problem asks for a path between two given points such that the sum of its edges is minimized. The problem has a rich history and has been studied extensively since the 1950’s in many areas of computer science, among them network optimization, graph theory and computational geometry. In this chapter we consider two versions of the problem; the shortest path in a transportation ...

We investigate the uncertain versions of two classical combinatorial optimization problems, namely the Single-Pair Shortest Path Problem (SP-SPP) and the Single-Source Shortest Path Problem (SS-SPP). The former consists of finding a path of minimum length connecting two specific nodes in a finite directed graph G; the latter consists of finding the shortest paths from a fixed node to the remain...

In this paper, we reduce the logspace shortest path problem to biconnected graphs; in particular, we present a logspace shortest path algorithm for general graphs which uses a logspace shortest path oracle for biconnected graphs. We also present a linear time logspace shortest path algorithm for graphs with bounded vertex degree and biconnected component size, which does not rely on an oracle. ...

In this paper we consider the Origin-Destination (O-D) shortest path problem. We define the O-D shortest path problem as follows: We are given the set of nodes and edges in a network. Associated with each edge is a weight. In addition, we are given two subsets of the node set. One set is called the set of origin nodes and the other is called the set of destination nodes. The objective of the O-...