Sciweavers

2125 search results - page 142 / 425
» On Graph Complexity
Sort
View
COMPLEX
2009
Springer
15 years 2 months ago
A Comparative Analysis of Specific Spatial Network Topological Models
Creating ensembles of random but "realistic" topologies for complex systems is crucial for many tasks such as benchmark generation and algorithm analysis. In general, exp...
Jun Wang, Gregory M. Provan
FASE
2008
Springer
14 years 12 months ago
Consistent Integration of Models Based on Views of Visual Languages
Abstract. The complexity of large system models in software engineering nowadays is mastered by using different views. View-based modeling aims at creating small, partial models, e...
Hartmut Ehrig, Karsten Ehrig, Claudia Ermel, Ulrik...
TCS
2008
14 years 10 months ago
Digraph measures: Kelly decompositions, games, and orderings
We consider various well-known, equivalent complexity measures for graphs such as elimination orderings, k-trees and cops and robber games and study their natural translations to ...
Paul Hunter, Stephan Kreutzer
SSS
2010
Springer
158views Control Systems» more  SSS 2010»
14 years 8 months ago
Low Memory Distributed Protocols for 2-Coloring
In this paper we present new distributed protocols to color even rings and general bipartite graphs. Our motivation is to provide algorithmic explanation for human subject experime...
Amos Israeli, Mathew D. McCubbins, Ramamohan Patur...
ICIP
2007
IEEE
15 years 11 months ago
Modeling of Front Evolution with Graph Cut Optimization
In this paper, we present a novel active contour model, in which the traditional gradient descent optimization is replaced by graph cut optimization. The basic idea is to first de...
Hang Chang, Qing Yang, Manfred Auer, Bahram Parvin