Results 1  10
of
2,187
Shortest path algorithms with integer edge costs
, 2002
"... Single source shortest path algorithms are concerned with finding the shortest distances to all vertices in a graph from a single source vertex. Dijkstra (1959) first came up with an O(n²) algorithm to solve such a problem, where n is the number of vertices in the graph. If the given graph has a spe ..."
Abstract
 Add to MetaCart
special property that all edge costs within the graph are integers and these edge costs are bounded by some constant c, it is possible to improve the underlying data structure of Dijkstra’s algorithm to improve the
STRAIGHT LINE EMBEDDINGS OF CUBIC PLANAR GRAPHS WITH INTEGER EDGE LENGTHS
, 2008
"... We prove that every simple cubic planar graph admits a planar embedding such that each edge is embedded as a straight line segment of integer length. ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
We prove that every simple cubic planar graph admits a planar embedding such that each edge is embedded as a straight line segment of integer length.
double coor3[], Integer edge3[], Integer conn3[], Integer reft3[],
"... nag_mesh2d_join (d06dbc) joins together two adjacent, or overlapping, meshes. If the two meshes are adjacent then vertices belonging to the part of the boundary forming the common interface should coincide. If the two meshes overlap then vertices and triangles in the overlapping zone should coincide ..."
Abstract
 Add to MetaCart
nag_mesh2d_join (d06dbc) joins together two adjacent, or overlapping, meshes. If the two meshes are adjacent then vertices belonging to the part of the boundary forming the common interface should coincide. If the two meshes overlap then vertices and triangles in the overlapping zone should coincide too. This function is partly derived from material in the MODULEF package from INRIA (Institut National de Recherche en Informatique et Automatique).
void nag_mesh2d_smooth (Integer nv, Integer nelt, Integer nedge, double coor[], const Integer edge[], const Integer conn[], Integer nvfix,
"... nag_mesh2d_smooth (d06cac) uses a barycentering technique to smooth a given mesh. ..."
Abstract
 Add to MetaCart
nag_mesh2d_smooth (d06cac) uses a barycentering technique to smooth a given mesh.
void nag_mesh2d_smooth (Integer nv, Integer nelt, Integer nedge, double coor[], const Integer edge[], const Integer conn[], Integer nvfix,
"... nag_mesh2d_smooth (d06cac) uses a barycentering technique to smooth a given mesh. ..."
Abstract
 Add to MetaCart
nag_mesh2d_smooth (d06cac) uses a barycentering technique to smooth a given mesh.
Retiming Synchronous Circuitry
 ALGORITHMICA
, 1991
"... This paper describes a circuit transformation called retiming in which registers are added at some points in a circuit and removed from others in such a way that the functional behavior of the circuit as a whole is preserved. We show that retiming can be used to transform a given synchronous circui ..."
Abstract

Cited by 376 (3 self)
 Add to MetaCart
circuit into a more efficient circuit under a variety of different cost criteria. We model a circuit as a graph in which the vertex set Visa collection of combinational logic elements and the edge set E is the set of interconnections, each of which may pass through zero or more registers. We give an 0(V
Polynomial time algorithms for multicast network code construction
 IEEE TRANS. ON INFO. THY
, 2005
"... The famous maxflow mincut theorem states that a source node can send information through a network ( ) to a sink node at a rate determined by the mincut separating and. Recently, it has been shown that this rate can also be achieved for multicasting to several sinks provided that the intermediat ..."
Abstract

Cited by 316 (29 self)
 Add to MetaCart
algorithms for designing linear codes for directed acyclic graphs with edges of unit capacity. We extend these algorithms to integer capacities and to codes that are tolerant to edge failures.
#include <nag.h> #include <nagd06.h> void nag_mesh2d_smooth (Integer nv, Integer nelt, Integer nedge, double coor[], const Integer edge[], const Integer conn[], Integer nvfix,
"... nag_mesh2d_smooth (d06cac) uses a barycentering technique to smooth a given mesh. ..."
Abstract
 Add to MetaCart
nag_mesh2d_smooth (d06cac) uses a barycentering technique to smooth a given mesh.
Results 1  10
of
2,187