Sciweavers

22 search results - page 3 / 5
» mics 2010
Sort
View
MICS
2010
124views more  MICS 2010»
13 years 17 days ago
An Optimal Algorithm for the k-Fixed-Endpoint Path Cover on Proper Interval Graphs
In this paper we consider the k-fixed-endpoint path cover problem on proper interval graphs, which is a generalization of the path cover problem. Given a graph G and a set T of k v...
George B. Mertzios, Walter Unger
MICS
2010
134views more  MICS 2010»
13 years 4 months ago
Scale Free Properties of Random k-Trees
Scale free graphs have attracted attention as their non-uniform structure that can be used as a model for many social networks including the WWW and the Internet. In this paper, w...
Colin Cooper, Ryuhei Uehara
MICS
2010
102views more  MICS 2010»
13 years 4 months ago
On Conditional Covering Problem
The conditional covering problem (CCP) aims to locate facilities on a graph, where the vertex set represents both the demand points and the potential facility locations. The proble...
Balasubramanian Sivan, S. Harini, C. Pandu Rangan
MICS
2010
92views more  MICS 2010»
13 years 4 months ago
Specifying Rewrite Strategies for Interactive Exercises
Strategies specify how a wide range of exercises can be solved incrementally, such as bringing a logic proposition to disjunctive normal form, reducing a matrix, or calculating wit...
Bastiaan Heeren, Johan Jeuring, Alex Gerdes
MICS
2010
137views more  MICS 2010»
13 years 4 months ago
Finding Range Minima in the Middle: Approximations and Applications
Abstract. A Range Minimum Query asks for the position of a minimal element between two specified array-indices. We consider a natural extension of this, where our further constrai...
Johannes Fischer, Volker Heun