Sciweavers

5606 search results - page 448 / 1122
» Randomization Techniques for Graphs.
Sort
View
ICMT
2010
Springer
15 years 11 months ago
Synthesis of OCL Pre-conditions for Graph Transformation Rules
Graph transformation (GT) is being increasingly used in Model Driven Engineering (MDE) to describe in-place transformations like animations and refactorings. For its practical use,...
Jordi Cabot, Robert Clarisó, Esther Guerra,...
ISCC
1999
IEEE
15 years 11 months ago
On Network Survivability Algorithms Based on Trellis Graph Transformations
Due to the wide range of services being supported, telecommunications networks are loaded with massive quantities of information. This stimulates extra concern for network surviva...
Soulla Louca, Andreas Pitsillides, George Samaras
EMNLP
2006
15 years 8 months ago
Unsupervised Information Extraction Approach Using Graph Mutual Reinforcement
Information Extraction (IE) is the task of extracting knowledge from unstructured text. We present a novel unsupervised approach for information extraction based on graph mutual r...
Hany Hassan, Ahmed Hassan, Ossama Emam
IJCAI
2001
15 years 8 months ago
Backtracking Through Biconnected Components of a Constraint Graph
The algorithm presented here, BCC, is an enhancement of the well known Backtrack used to solve constraint satisfaction problems. Though most backtrack improvements rely on propaga...
Jean-François Baget, Yannic S. Tognetti
JUCS
2006
94views more  JUCS 2006»
15 years 6 months ago
Completeness in the Boolean Hierarchy: Exact-Four-Colorability, Minimal Graph Uncolorability, and Exact Domatic Number Problems
: This paper surveys some of the work that was inspired by Wagner's general technique to prove completeness in the levels of the boolean hierarchy over NP and some related res...
Tobias Riege, Jörg Rothe