Sciweavers

1883 search results - page 95 / 377
» Ordered theta graphs
Sort
View
CIMCA
2005
IEEE
14 years 1 months ago
Potentials and Limits of Graph-Algorithms for Discovering Ontology Patterns
The aim of the research presented in this paper is to contribute to reduction of development time for ontologies by discovering reusable parts and patterns. The approach is to use...
Christer Thörn, Orjan Eriksson, Eva Blomqvist...
IANDC
2007
111views more  IANDC 2007»
13 years 7 months ago
Expressiveness and complexity of graph logic
We investigate the complexity and expressive power of a spatial logic for reasoning about graphs. This logic was previously introduced by Cardelli, Gardner and Ghelli, and provide...
Anuj Dawar, Philippa Gardner, Giorgio Ghelli
NOMS
2010
IEEE
195views Communications» more  NOMS 2010»
13 years 5 months ago
Optimized network configuration parameter assignment based on graph coloring
The trend for future mobile networks is to move away from Network Elements (NEs) delivered with specially tailored configurations towards off-the-shelf products. The configurations...
Tobias Bandh, Georg Carle, Henning Sanneck, Lars-C...
ORDER
2011
13 years 2 months ago
Strict Betweennesses Induced by Posets as well as by Graphs
For a finite poset P = (V, ≤), let Bs(P) consist of all triples (x, y, z) ∈ V 3 such that either x < y < z or z < y < x. Similarly, for every finite, simple, and...
Dieter Rautenbach, Philipp Matthias Schäfer
EVOW
2004
Springer
14 years 1 months ago
Binary Merge Model Representation of the Graph Colouring Problem
This paper describes a novel representation and ordering model that, aided by an evolutionary algorithm, is used in solving the graph k-colouring problem. Its strength lies in redu...
István Juhos, Attila Tóth, Jano I. v...