The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
Abhimanyu M. Ambalath, Radheshyam Balasundaram, Ch...
The extensive work on Knowledge Engineering in the 1990s has resulted in a systematic analysis of task-types, and the corresponding problem solving methods that can be deployed fo...
Frank van Harmelen, Annette ten Teije, Holger Wach...
Although the issues of routing and scheduling in packet radio networks are highly interdependent, few studies have addressed their interactions. In this paper, we address the prob...
Jeffrey E. Wieselthier, Craig M. Barnhart, Anthony...
We consider a map labeling problem, where the sites to be labeled are restricted on a line L. This is quite common e.g. in schematized maps for road or subway networks. Each site ...
Michael A. Bekos, Michael Kaufmann, Antonios Symvo...
—In layered networks, a single failure at a lower layer may cause multiple failures in the upper layers. As a result, traditional schemes that protect against single failures may...