169 search results - page 15 / 34 » Counting paths in digraphs |
ISSTA
1989
ACM
14 years 1 months ago
1989
ACM
The all-du-paths software testing criterion is the most discriminating of the data ow testing criteria of Rapps and Weyuker. Unfortunately, in the worst case, the criterion requir...
EJC
2011
13 years 4 months ago
2011
Noncrossing set partitions, nonnesting set partitions, Dyck paths, and rooted plane trees are four classes of Catalan objects which carry a notion of type. There exists a product f...
INFOCOM
2008
IEEE
14 years 4 months ago
2008
IEEE
—Knowledge of the network path properties such as latency, hop count, loss and bandwidth is key to the performance of overlay networks, grids and p2p applications. Network operat...
ANCS
2009
ACM
13 years 7 months ago
2009
ACM
Torus, mesh, and flattened butterfly networks have all been considered as candidate architectures for on-chip interconnection networks. In this paper, we study the problem of opti...
FPGA
2008
ACM
13 years 11 months ago
2008
ACM
This paper presents a new technology mapper, WireMap. The mapper uses an edge flow heuristic to improve the routability of a mapped design. The heuristic is applied during the ite...