11 search results - page 2 / 3 » Parallel morphing of trees and cycles |
DAM
2007
13 years 5 months ago
2007
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
EDOC
2008
IEEE
14 years 7 days ago
2008
IEEE
The definition and management of access rules (e.g., to control the access to business documents and business functions) is an important task within any enterprise information sy...
DAM
2010
13 years 5 months ago
2010
We consider the process of cleaning a network where at each time step, all vertices that have at least as many brushes as incident, contaminated edges, send brushes down these edg...
ISCAPDCS
2007
13 years 7 months ago
2007
—The tremendous growth in the information culture, efficient digital searches are needed to extract and identify information from huge data. The notion that evolution in silicon ...
SPAA
2004
ACM
13 years 11 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...