Sciweavers

1756 search results - page 123 / 352
» Directed scale-free graphs
Sort
View
USS
2008
13 years 10 months ago
Securing Provenance
Provenance describes how an object came to be in its present state. Intelligence dossiers, medical records and corporate financial reports capture provenance information. Many of ...
Uri Braun, Avraham Shinnar, Margo I. Seltzer
CCCG
2008
13 years 9 months ago
Memory Requirements for Local Geometric Routing and Traversal in Digraphs
Local route discovery in geometric, strongly connected, undirected plane graphs is guaranteed by the Face Routing algorithm. The algorithm is local and geometric in the sense that...
Maia Fraser, Evangelos Kranakis, Jorge Urrutia
CORR
2002
Springer
108views Education» more  CORR 2002»
13 years 8 months ago
Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way
We introduce a new approach for drawing diagrams. Our approach is to use a technique we call confluent drawing for visualizing non-planar graphs in a planar way. This approach all...
Matthew Dickerson, David Eppstein, Michael T. Good...
TEC
2002
119views more  TEC 2002»
13 years 7 months ago
Graph-based evolutionary design of arithmetic circuits
Abstract--In this paper, we present an efficient graph-based evolutionary optimization technique called evolutionary graph generation (EGG) and the proposed approach is applied to ...
Dingjun Chen, Takafumi Aoki, Naofumi Homma, Toshik...
CORR
2008
Springer
118views Education» more  CORR 2008»
13 years 7 months ago
Decentralized Search with Random Costs
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
Oskar Sandberg