Sciweavers

3958 search results - page 6 / 792
» Dynamic Graph Algorithms with Applications
Sort
View
MEMBRANE
2004
Springer
15 years 2 months ago
Evolution and Oscillation in P Systems: Applications to Biological Phenomena
Some computational aspects and behavioral patterns of P systems are considered, emphasizing dynamical properties that turn useful in characterizing the behavior of biological and b...
Vincenzo Manca, Luca Bianco, Federico Fontana
CODES
2003
IEEE
15 years 2 months ago
Deriving process networks from weakly dynamic applications in system-level design
We present an approach to the automatic derivation of executable Process Network specifications from Weakly Dynamic Applications. We introduce the notions of Dynamic Single Assig...
Todor Stefanov, Ed F. Deprettere
75
Voted
JGAA
2007
88views more  JGAA 2007»
14 years 9 months ago
Dynamic Spectral Layout with an Application to Small Worlds
Spectral methods are naturally suited for dynamic graph layout because, usually, moderate changes of a graph yield moderate changes of the layout. We discuss some general principl...
Ulrik Brandes, Daniel Fleischer, Thomas Puppe
TALG
2008
127views more  TALG 2008»
14 years 9 months ago
Fully dynamic algorithms for chordal graphs and split graphs
We present the rst dynamic algorithm that maintains a clique tree representation of a chordal graph and supports the following operations: (1) query whether deleting or inserting ...
Louis Ibarra
WADS
2009
Springer
256views Algorithms» more  WADS 2009»
15 years 4 months ago
Dynamic Graph Clustering Using Minimum-Cut Trees
Abstract. Algorithms or target functions for graph clustering rarely admit quality guarantees or optimal results in general. Based on properties of minimum-cut trees, a clustering ...
Robert Görke, Tanja Hartmann, Dorothea Wagner