Sciweavers

1136 search results - page 32 / 228
» Finding Small Holes
Sort
View
JGAA
2006
127views more  JGAA 2006»
13 years 9 months ago
A New Algorithm for Finding Minimal Cycle-Breaking Sets of Turns in a Graph
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...
Lev B. Levitin, Mark G. Karpovsky, Mehmet Mustafa,...
CMOT
2002
112views more  CMOT 2002»
13 years 9 months ago
Finding Optimal Targets for Change Agents: A Computer Simulation of Innovation Diffusion
We introduce a diffusion of innovation model based on a network threshold approach. Realistic network and threshold data were gathered regarding the diffusion of new software tool...
Dirk Maienhofer, Thomas A. Finholt
MICS
2010
137views more  MICS 2010»
13 years 7 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
TSE
2010
161views more  TSE 2010»
13 years 7 months ago
Finding Bugs in Web Applications Using Dynamic Test Generation and Explicit-State Model Checking
— Web script crashes and malformed dynamically-generated web pages are common errors, and they seriously impact the usability of web applications. Current tools for web-page vali...
Shay Artzi, Adam Kiezun, Julian Dolby, Frank Tip, ...
FSTTCS
2010
Springer
13 years 7 months ago
Finding Independent Sets in Unions of Perfect Graphs
ABSTRACT. The maximum independent set problem (MAXIS) on general graphs is known to be NPhard to approximate within a factor of n1-, for any > 0. However, there are many "...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Samb...