• Publications
  • Influence
On sparse spanners of weighted graphs
TLDR
We give a simple algorithm for constructing sparse spanners for arbitrary weighted graphs and apply it to planar graphs. Expand
  • 516
  • 52
  • PDF
Graph spanners
  • 373
  • 13
New sparseness results on graph spanners
Let G=(V, E) be an n-vertex connected graph with positive edge weights. A subgraph G′=(V, E′) is a t-spanner of G if for all u, v∈V, the weighted distance between u and v in G′ is at most t times theExpand
  • 111
  • 10
New sparseness results on graph spanners
TLDR
Spanners of small weight can be constructed in polynomial time for graphs with positive edge weights. Expand
  • 96
  • 8
  • PDF
Maximum diameter of regular digraphs
  • J. Soares
  • Mathematics, Computer Science
  • J. Graph Theory
  • 1 November 1992
TLDR
We prove that every r-biregular digraph with n vertices has its directed diamter bounded by (3n - r - 3)/(r +1). Expand
  • 21
  • 2
Algorithms for Terminal Steiner Trees
TLDR
We present an approximation algorithm for the TST, which improves the 2ρ factor. Expand
  • 21
  • 1
  • PDF
Approximating Euclidean distances by small degree graphs
  • J. Soares
  • Mathematics, Computer Science
  • Discret. Comput. Geom.
  • 1 December 1994
TLDR
We consider the problem of approximating the distances among points of a Euclidean metric space: given a finite setV of points in ℝd, we want to construct a sparset-spanner of the complete weighted graph induced byV. Expand
  • 23
  • 1
  • PDF
Algorithms for Maximum Independent Set in Convex Bipartite Graphs
TLDR
A bipartite graph G=(V,W,E) is convex if there exists an ordering of the vertices of W such that, for each v∈V, the neighbors of v are consecutive in W. Expand
  • 9
  • 1
Algorithms for terminal Steiner trees
TLDR
We propose a factor 2@r-@r/(3@ r-2) approximation algorithm for the terminal Steiner tree problem, where @r is the approximation factor of a given algorithm. Expand
  • 23
Graph Spanners: a Survey
  • 38
...
1
2
...