Sciweavers

2304 search results - page 220 / 461
» On the Vulnerability of Large Graphs
Sort
View
STTT
2008
86views more  STTT 2008»
15 years 6 months ago
Properties of state spaces and their applications
Explicit model checking algorithms explore the full state space of a system. State spaces are usually treated as directed graphs without any specific features. We gather a large co...
Radek Pelánek
CORR
2002
Springer
96views Education» more  CORR 2002»
15 years 6 months ago
Models and Tools for Collaborative Annotation
The Annotation Graph Toolkit (AGTK) is a collection of software which facilitates development of linguistic annotation tools. AGTK provides a database interface which allows appli...
Xiaoyi Ma, Haejoong Lee, Steven Bird, Kazuaki Maed...
SIAMDM
2010
117views more  SIAMDM 2010»
15 years 5 months ago
Design is as Easy as Optimization
We consider the class of max-min and min-max optimization problems subject to a global budget (or weight) constraint and we undertake a systematic algorithmic and complexitytheore...
Deeparnab Chakrabarty, Aranyak Mehta, Vijay V. Vaz...
WIOPT
2010
IEEE
15 years 5 months ago
K-shell decomposition for dynamic complex networks
—K-shell (or k-core) graph decomposition methods were introduced as a tool for studying the structure of large graphs. K-shell decomposition methods have been recently proposed [...
Daniele Miorandi, Francesco De Pellegrini
202
Voted
CPHYSICS
2011
271views Education» more  CPHYSICS 2011»
14 years 10 months ago
A dedicated algorithm for calculating ground states for the triangular random bond Ising model
In the presented article we present an algorithm for the computation of ground state spin configurations for the 2d random bond Ising model on planar triangular lattice graphs. T...
O. Melchert, A. K. Hartmann