Sciweavers

1736 search results - page 346 / 348
» On antimagic directed graphs
Sort
View
TVCG
2008
134views more  TVCG 2008»
13 years 6 months ago
Balloon Focus: a Seamless Multi-Focus+Context Method for Treemaps
The treemap is one of the most popular methods for visualizing hierarchical data. When a treemap contains a large number of items, inspecting or comparing a few selected items in a...
Ying Tu, Han-Wei Shen
CONSTRAINTS
1998
127views more  CONSTRAINTS 1998»
13 years 5 months ago
Experimental Analysis of Numeric and Symbolic Constraint Satisfaction Techniques for Temporal Reasoning
Many temporal applications like planning and scheduling can be viewed as special cases of the numeric and symbolic temporal constraint satisfaction problem. Thus we have developed ...
Malek Mouhoub, François Charpillet, Jean Pa...
CN
1999
100views more  CN 1999»
13 years 5 months ago
Testing protocols modeled as FSMs with timing parameters
An optimization method is introduced for generating minimum-length test sequences taking into account timing constraints for FSM models of communication protocols. Due to active t...
M. Ümit Uyar, Mariusz A. Fecko, Adarshpal S. ...
JCT
1998
193views more  JCT 1998»
13 years 5 months ago
Fractional Kernels in Digraphs
The aim of this note is to point out some combinatorial applications of a lemma of Scarf, proved first in the context of game theory. The usefulness of the lemma in combinatorics...
Ron Aharoni, Ron Holzman
TON
2002
117views more  TON 2002»
13 years 5 months ago
Generalized loop-back recovery in optical mesh networks
Current means of providing loop-back recovery, which is widely used in SONET, rely on ring topologies, or on overlaying logical ring topologies upon physical meshes. Loop-back is d...
Muriel Médard, Richard A. Barry, Steven G. ...