Sciweavers

212 search results - page 8 / 43
» On Lengths of Rainbow Cycles
Sort
View
DISOPT
2008
113views more  DISOPT 2008»
13 years 9 months ago
The inverse 1-median problem on a cycle
Abstract. Let the graph G = (V, E) be a cycle with n + 1 vertices, nonnegative vertex weights and positive edge lengths. The inverse 1-median problem on a cycle consists in changin...
Rainer E. Burkard, Carmen Pleschiutschnig, Jianzho...
FSTTCS
2001
Springer
14 years 2 months ago
Distributed LTL Model Checking Based on Negative Cycle Detection
Abstract. This paper addresses the state explosion problem in automata based LTL model checking. To deal with large space requirements we turn to use a distributed approach. All th...
Lubos Brim, Ivana Cerná, Pavel Krcál...
IS
2006
13 years 9 months ago
Adaptive cycle management in soft real-time disk retrieval
The objective of this study is to determine the right cycle management policy to service periodic soft real-time disk retrieval. Cycle based disk scheduling provides an effective ...
Youjip Won, Ilhoon Shin, Kern Koh
CN
2010
111views more  CN 2010»
13 years 9 months ago
HPC5: An efficient topology generation mechanism for Gnutella networks
Abstract. In this paper, we propose a completely distributed topology generation mechanism named HPC5 for Gnutella network. A Gnutella topology will be efficient and scalable if it...
Joydeep Chandra, Santosh Kumar Shaw, Niloy Ganguly
COMPGEOM
2010
ACM
14 years 2 months ago
Output-sensitive algorithm for the edge-width of an embedded graph
Let G be an unweighted graph of complexity n cellularly embedded in a surface (orientable or not) of genus g. We describe improved algorithms to compute (the length of) a shortest...
Sergio Cabello, Éric Colin de Verdiè...