Sciweavers

990 search results - page 136 / 198
» Sub-Graphs of Complete Graph
Sort
View
FUIN
2008
98views more  FUIN 2008»
13 years 7 months ago
A Restarted Strategy for Efficient Subsumption Testing
We study runtime distributions of subsumption testing. On graph data randomly sampled from two different generative models we observe a gradual growth of the tails of the distribut...
Ondrej Kuzelka, Filip Zelezný
CPC
2006
110views more  CPC 2006»
13 years 7 months ago
Bootstrap Percolation on Infinite Trees and Non-Amenable Groups
Abstract. Bootstrap percolation on an arbitrary graph has a random initial configuration, where each vertex is occupied with probability p, independently of each other, and a deter...
József Balogh, Yuval Peres, Gábor Pe...
IJON
2007
81views more  IJON 2007»
13 years 7 months ago
Statistical analysis of spatially embedded networks: From grid to random node positions
Many conceptual studies of local cortical networks assume completely random wiring. For spatially extended networks, however, such random graph models are inadequate. The geometry...
Nicole Voges, Ad Aertsen, Stefan Rotter
TALG
2008
67views more  TALG 2008»
13 years 7 months ago
Structure and linear-time recognition of 4-leaf powers
A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is a k-le...
Andreas Brandstädt, Van Bang Le, R. Sritharan
IS
2007
13 years 7 months ago
Improving process models by discovering decision points
Workflow management systems (WfMS) are widely used by business enterprises as tools for administrating, automating and scheduling the business process activities with the availab...
Sharmila Subramaniam, Vana Kalogeraki, Dimitrios G...