Sciweavers

1633 search results - page 172 / 327
» Planar Map Graphs
Sort
View
VISSYM
2007
15 years 3 months ago
Online Dynamic Graph Drawing
This paper presents an algorithm for drawing a sequence of graphs online. The algorithm strives to maintain the global structure of the graph and thus the user's mental map, ...
Yaniv Frishman, Ayellet Tal
GC
2010
Springer
14 years 11 months ago
Integer Functions on the Cycle Space and Edges of a Graph
A directed graph has a natural Z-module homomorphism from the underlying graph’s cycle space to Z where the image of an oriented cycle is the number of forward edges minus the n...
Daniel C. Slilaty
119
Voted
ECCC
2010
143views more  ECCC 2010»
14 years 10 months ago
Space-Efficient Algorithms for Reachability in Surface-Embedded Graphs
We consider the reachability problem for a certain class of directed acyclic graphs embedded on surfaces. Let G(m, g) be the class of directed acyclic graphs with m = m(n) source ...
Derrick Stolee, N. V. Vinodchandran
94
Voted
DM
2002
102views more  DM 2002»
15 years 14 days ago
Totally magic graphs
A total labeling of a graph with v vertices and e edges is defined as a one-to-one map taking the vertices and edges onto the integers 1, 2,
Geoffrey Exoo, Alan C. H. Ling, John P. McSorley, ...
111
Voted
DCOSS
2006
Springer
15 years 4 months ago
Efficient In-Network Processing Through Local Ad-Hoc Information Coalescence
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...
Onur Savas, Murat Alanyali, Venkatesh Saligrama