Sciweavers

1477 search results - page 21 / 296
» On Graph Problems in a Semi-streaming Model
Sort
View
IEEEARES
2009
IEEE
15 years 4 months ago
A Mobile Ambients-Based Approach for Network Attack Modelling and Simulation
Abstract—Attack Graphs are an important support for assessment and subsequent improvement of network security. They reveal possible paths an attacker can take to break through se...
Virginia N. L. Franqueira, Pascal van Eck, Roel Wi...
SIMVIS
2004
14 years 11 months ago
3D Shape Matching Using Skeleton Graphs
We describe a method to match 3D polygonal geometry models using their internal skeleton graphs. These graphs carry information about the overall shape of the model. In order to m...
Angela Brennecke, Tobias Isenberg
ESA
2000
Springer
104views Algorithms» more  ESA 2000»
15 years 1 months ago
Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphs
The p-center problem is to locate p facilities on a network so as to minimize the largest distance from a demand point to its nearest facility. The p-median problem is to locate p ...
Sergei Bespamyatnikh, Binay K. Bhattacharya, J. Ma...
EUROPAR
1999
Springer
15 years 2 months ago
A New Algorithm for Multi-objective Graph Partitioning
Recently, a number of graph partitioning applications have emerged with additional requirements that the traditional graph partitioning model alone cannot e ectively handle. One s...
Kirk Schloegel, George Karypis, Vipin Kumar
STTT
2010
132views more  STTT 2010»
14 years 8 months ago
Evaluation of Kermeta for solving graph-based problems
Kermeta is a meta-language for specifying the structure and behavior of graphs of interconnected objects called models. In this paper, we show that Kermeta is relatively suitable f...
Naouel Moha, Sagar Sen, Cyril Faucher, Olivier Bar...