2294 search results - page 277 / 459 » From Path Graphs to Directed Path Graphs |
115
click to vote
JCT
2006
15 years 3 months ago
2006
Consider two locally finite rooted trees as equivalent if each of them is a topological minor of the other, with an embedding preserving the tree-order. Answering a question of va...
126
Voted
TMC
2008
15 years 3 months ago
2008
Computing and maintaining network structures for efficient data aggregation incurs high overhead for dynamic events where the set of nodes sensing an event changes with time. Moreo...
120
Voted
CN
2004
15 years 3 months ago
2004
Effective placement of resources used to support distributed services in the Internet depends on an accurate representation of Internet topology and routing. Representations of au...
100
Voted
ENTCS
2002
15 years 3 months ago
2002
In this work we present Zeus, a Distributed Model-Checker that evolves from the tool Kronos [8] and that currently can handle backwards computation of TCTLreachability properties ...
137
Voted
TCAD
2002
15 years 3 months ago
2002
Many tasks in CAD, such as equivalence checking, property checking, logic synthesis, and false paths analysis require efficient Boolean reasoning for problems derived from circuits...