Results 1  10
of
96
VertexTransitivity and Routing for Cayley Graphs in GCR Representations
 Proc. of the 1992 ACM Symposium on Applied Computing
, 1992
"... Dense, symmetric graphs are good candidates for effective interconnection networks. Cayley graphs, formed by Borel subgroups, are the densest, symmetric graphs known for a range of diameters [1]. Every Cayley graph can be represented with integer node labels by transforming into another existing top ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
topology, Generalized Chordal Ring (GCR) [2]. However, generally speaking, GCR graphs are not fully symmetric. In this paper, we provide a framework for the formulation of the complete symmetry (or vertextransitivity) of Cayley graphs in the integer domain of GCR representations. Successful realization
The 25th Workshop on Combinatorial Mathematics and Computation Theory The Weighted AllPairsShortestPathLength Problem on TwoTerminal SeriesParallel Graphs
"... Let G(V, E) be a nvertex graph with V = { v1 vn} and each edge e = ( i, ) is associated with two real weights, W ( → ) and W ( →). v v j v v v v Let P be a path from any source vertex s to any destination vertex d and assume that P is s = u → u2 ut i = d, t ≥ 2. The length of P, denoted by Len(P ..."
Abstract
 Add to MetaCart
Let G(V, E) be a nvertex graph with V = { v1 vn} and each edge e = ( i, ) is associated with two real weights, W ( → ) and W ( →). v v j v v v v Let P be a path from any source vertex s to any destination vertex d and assume that P is s = u → u2 ut i = d, t ≥ 2. The length of P, denoted by Len
Virtual Vertex Routing (VVR) for CourseBased Vehicular Ad Hoc Networks
 Proc. IEEE Wireless Comm. and Networking Conf. (WCNC
, 2007
"... routing protocols appear to be a fascinating option since they have generally low delay and small routing overhead and GPS devices are becoming affordable. However, we reveal that geographic routing protocols suffer from routing holes when nodes are distributed only on lines such as cars on roads, t ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
, trains on rails, and ships on courses. To tackle this problem, we propose a novel geographic routing protocol, Virtual Vertex Routing (VVR), which uses the information of the lines. Using graph formulation, we introduce a new concept, the proximity of a vertex (or a virtual vertex). An intermediate node
A LEMKELIKE ALGORITHM FOR THE MULTICLASS NETWORK EQUILIBRIUM PROBLEM
, 2013
"... We consider a nonatomic congestion game on a connected graph, with several classes of players. Each player wants to go from its origin vertex to its destination vertex at the minimum cost and all players of a given class share the same characteristics: cost functions on each arc, and origindestin ..."
Abstract
 Add to MetaCart
We consider a nonatomic congestion game on a connected graph, with several classes of players. Each player wants to go from its origin vertex to its destination vertex at the minimum cost and all players of a given class share the same characteristics: cost functions on each arc, and origindestination
Wavelength Assignment in Optical Networks with Fixed Fiber Capacity
"... 1 Introduction We consider the problem of achieving transparency in optical networks. A pathis said to be routed transparently if it is assigned the same wavelength from its source to its destination. Transparency is desirable since wavelength conversionis expensive and defeats the advantage of all ..."
Abstract
 Add to MetaCart
optical transmission. More formally, we consider an optical network consisting of vertices andoptical links and a set of demands each of which needs to be routed from a source vertex to a destination vertex on a single wavelength. Each optical linkhas one or multiple parallel fibers deployed
BMC: An Efficient Method to Evaluate Probabilistic Reachability Queries
 In DASFAA
, 2011
"... Abstract. Reachability query is a fundamental problem in graph databases. It answers whether or not there exists a path between a source vertex and a destination vertex and is widely used in various applications including road networks, social networks, world wide web and bioinformatics. In some em ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract. Reachability query is a fundamental problem in graph databases. It answers whether or not there exists a path between a source vertex and a destination vertex and is widely used in various applications including road networks, social networks, world wide web and bioinformatics. In some
CS 683 Advanced Design and Analysis of Algorithms February 25, 2008 Lecture 16: Small World Graphs Instructor
"... Local algorithm for r = 2 In the last lecture we discussed Small Word Graphs. We continue now with a proof that when r = 2, there exists a local algorithm to find a short path from a source vertex s, to a destination vertex t, in O(log n) steps. We reuse Kleinberg’s [1] algorithm from Lecture 15. Al ..."
Abstract
 Add to MetaCart
Local algorithm for r = 2 In the last lecture we discussed Small Word Graphs. We continue now with a proof that when r = 2, there exists a local algorithm to find a short path from a source vertex s, to a destination vertex t, in O(log n) steps. We reuse Kleinberg’s [1] algorithm from Lecture 15
BMC: An Efficient Method to Evaluate Probablistic Reachability Queries
"... Abstract. Reachability query is a fundamental problem in graph databases. It answers whether or not there exists a path between a source vertex and a destination vertex and is widely used in various applications including road networks, social networks, world wide web and bioinformatics. In some eme ..."
Abstract
 Add to MetaCart
Abstract. Reachability query is a fundamental problem in graph databases. It answers whether or not there exists a path between a source vertex and a destination vertex and is widely used in various applications including road networks, social networks, world wide web and bioinformatics. In some
Straightest Paths on Meshes By Cutting Planes
, 2006
"... Geodesic paths and distances on meshes are used for many applications such as parameterization, remeshing, mesh segmentation, and simulations of natural phenomena. Noble works to compute shortest geodesic paths have been published. In this paper, we present a new approach to compute the straightes ..."
Abstract
 Add to MetaCart
the straightest path from a source to one or more vertices on a manifold mesh with a boundary. A cutting plane with a source and a destination vertex is first defined. Then the straightest path between these two vertices is created by intersecting the cutting plane with faces on the mesh. We demonstrate that our
Using Locationbased Services for the Performance Evaluation in Wireless Networks
"... When creating a scenario for the performance evaluation of wireless networks modeling the mobility is an important task. The results of the performance evaluation strongly depend on the model used [2]. Typical assumptions of many models are uniform selection of destinations and nodes are allowed to ..."
Abstract
 Add to MetaCart
position on the graph, choose a destination (vertex), move there at random velocity, and choose the next destination and velocity. The challenge of this approach is to get an accurate and realistic
Results 1  10
of
96