Sciweavers

2294 search results - page 43 / 459
» From Path Graphs to Directed Path Graphs
Sort
View
CGF
2010
118views more  CGF 2010»
15 years 2 months ago
The Readability of Path-Preserving Clusterings of Graphs
Graph visualization systems often exploit opaque metanodes to reduce visual clutter and improve the readability of large graphs. This filtering can be done in a path-preserving wa...
Daniel Archambault, Helen C. Purchase, Bruno Pinau...
COMPGEOM
2004
ACM
15 years 7 months ago
Time-varying reeb graphs for continuous space-time data
The Reeb graph is a useful tool in visualizing real-valued data obtained from computational simulations of physical processes. We characterize the evolution of the Reeb graph of a...
Herbert Edelsbrunner, John Harer, Ajith Mascarenha...
CEC
2005
IEEE
15 years 3 months ago
DNA implementation of k-shortest paths computation
In this paper, a demonstration of DNA computing for k-shortest paths of a weighted graph is realized by biochemical experiments in such a way that every path is encoded by oligonuc...
Zuwairie Ibrahim, Yusei Tsuboi, Mohd Saufee Muhamm...
92
Voted
CORR
2010
Springer
135views Education» more  CORR 2010»
15 years 2 months ago
Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graph
Let G = (V, E) be any undirected graph on V vertices and E edges. A path P between any two vertices u, v V is said to be t-approximate shortest path if its length is at most t tim...
Neelesh Khanna Surender Baswana
AIPS
2000
15 years 3 months ago
Planning with Reduced Operator Sets
Classical propositional STRIPSplanning is nothing but the searchfor a path in the state-transition graph induced by the operators in the planning problem. Whatmakes the problem ha...
Patrik Haslum, Peter Jonsson