3008 search results - page 70 / 602 » Independence in connected graphs |
138
click to vote
ECCC
2007
15 years 23 days ago
2007
We study graph properties which are testable for bounded degree graphs in time independent of the input size. Our goal is to distinguish between graphs having a predetermined grap...
94
Voted
GG
2008
Springer
15 years 1 months ago
2008
Springer
Parallel and sequential independence are central concepts in the concurrency theory of the double pushout (dpo) approach to graph rewriting. However, so far those same notions were...
77
Voted
ICC
2007
IEEE
15 years 7 months ago
2007
IEEE
—The Internet AS level topology, upon which BGP4 runs, plays a vital role in the analysis and study of the global routing behavior. However, the study of the topology itself is n...
117
Voted
ICC
2007
IEEE
15 years 7 months ago
2007
IEEE
—Multichannel communication in a Wireless Mesh Network with routers having multiple radio interfaces significantly enhances the network capacity. Efficient channel assignment an...
53
Voted
GECCO
2003
Springer
15 years 6 months ago
2003
Springer
Abstract. As a preprocessing for genetic algorithms, static reordering helps genetic algorithms effectively create and preserve high-quality schemata, and consequently improves th...