Sciweavers

CORR
2002
Springer
108views Education» more  CORR 2002»
13 years 11 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...
JACM
2007
121views more  JACM 2007»
13 years 11 months ago
(Almost) Tight bounds and existence theorems for single-commodity confluent flows
A flow of a commodity is said to be confluent if at any node all the flow of the commodity leaves along a single edge. In this paper we study single-commodity confluent flow pro...
Jiangzhuo Chen, Robert D. Kleinberg, Lászl&...
WADT
1998
Springer
14 years 3 months ago
Parallel Admissible Graph Rewriting
We investigate the rewrite relation over graphs induced by constructor-based weakly orthogonal graph rewriting systems. It is well known that this relation is not confluent in gene...
Rachid Echahed, Jean-Christophe Janodet