1952 search results - page 283 / 391 » Complete partitions of graphs |
162
click to vote
IJON
2007
15 years 6 months ago
2007
Many conceptual studies of local cortical networks assume completely random wiring. For spatially extended networks, however, such random graph models are inadequate. The geometry...
200
click to vote
TALG
2008
15 years 6 months ago
2008
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...
170
click to vote
IS
2007
15 years 6 months ago
2007
Workflow management systems (WfMS) are widely used by business enterprises as tools for administrating, automating and scheduling the business process activities with the availab...
137
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract--In the majority of studies on CSMA wireless networks, a contention graph is used to model the carrier sensing relationships among links. This is a 0-1 model in which two ...
149
click to vote
OPODIS
2004
15 years 7 months ago
2004
In this paper, we introduce the concept of hierarchy-based fault-local stabilization and a novel self-healing/fault-containment technique and apply them in Stalk. Stalk is an algo...