Sciweavers

2294 search results - page 160 / 459
» From Path Graphs to Directed Path Graphs
Sort
View
CORR
2011
Springer
173views Education» more  CORR 2011»
14 years 4 months ago
Multiple-Source Single-Sink Maximum Flow in Directed Planar Graphs in O(diameter*n*log(n)) Time
We develop a new technique for computing maximum flow in directed planar graphs with multiple sources and a single sink that significantly deviates from previously known techniqu...
Philip N. Klein, Shay Mozes
SAC
2009
ACM
15 years 4 months ago
Visualization of clustered directed acyclic graphs with node interleaving
Graph drawing and visualization represent structural information ams of abstract graphs and networks. An important subset of graphs is directed acyclic graphs (DAGs). E-Spring alg...
Pushpa Kumar, Kang Zhang
FOCS
2009
IEEE
15 years 4 months ago
Distance Oracles for Sparse Graphs
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
Christian Sommer 0002, Elad Verbin, Wei Yu
IPL
2008
104views more  IPL 2008»
14 years 10 months ago
A note on harmonic subgraphs in labelled geometric graphs
Let S be a set of n points in general position in the plane, labelled bijectively with the integers {0, 1, . . ., n - 1}. Each edge (the straight segment that joins two points) is...
Gabriela Araujo, József Balogh, Ruy Fabila ...
PR
2007
141views more  PR 2007»
14 years 9 months ago
A Riemannian approach to graph embedding
In this paper, we make use of the relationship between the Laplace–Beltrami operator and the graph Laplacian, for the purposes of embedding a graph onto a Riemannian manifold. T...
Antonio Robles-Kelly, Edwin R. Hancock