Search academic resources

The Knowledge Engineering Suite is an ontology production method, based on relationship networks, for knowledge representation inside specific contexts. The production of these ontologies has three basic steps, since cat...

Grafos es un software para la construcción, edición y análisis de grafos. Este software pretende ser de utilidad para la docencia y el aprendizaje de la teoría de grafos (graph theory), y otras disciplinas relacionad...

"It has been recently found using graph theory that measures of network structure can predict ratings of dream complexity, where increases in connectedness and decreases in randomness are observed in relation to increasi...

The Relationship Networks Project (RR - Redes de Relacionamento) is an innovative project, which intends to create a framework, which allows - through a fast data modeling - implementing interface elements that describe ...

Approximation algorithms for a class of planar graph problems, including planar independent set, planar vertex cover and planar dominating set, were intensively studied. The current upper bound on the running time of the...

It is a well established fact, that - in the case of classical random graphs like (variants of) Gn,p or random regular graphs - spectral methods yield efficient algorithms for clustering (e. g. colouring or bisection) pr...

This paper introduces an automatic procedure to assist on the interpretation of a large dataset when a similarity metric is available. We propose a visualization approach based on a graph layout method- ology that uses ...

It is commonly acknowledged that we need to accept and handle uncertainty when reasoning with real world data. The most profoundly studied measure of uncertainty is the probability. However, the general feeling is that p...

We compute the influence of a vertex on the connectivity structure of a directed network by using Shapley value theory. In general, the computation of such ratings is highly inefficient. We show how the computation can b...

In this paper we describe a computer system that calculates allocation to claims according to two kinds of bankruptcy rules. The first kind implemented are those whose results corresponds to the classical solutions of ga...

Este trabalho mostra uma forma de pensar concorrente. São utilizados algoritmos de grafos, algoritmo do menor caminho, para mostrar desde a especificação até a implementação de algoritmos concorrentes. Objetiva-se ...

Las interacciones en Visualización se constituyen en una necesidad esencial al permitir al usuario adaptar la representación visual a sus necesidades y ser el medio por el cual se explora el espacio de información sub...

The purpose of this paper is to describe how some theorems about constructions in categories can be seen as a way of doing generic programming. No prior knowledge of category theory is required to understand the paper. ...

We present a resolution technique of the University course Timetabling problem (UCTP), this technique is based in the implementation of Hypercube framework using the Max-Min Ant System. We presented the structure of the ...

The Standardization of a development process for systems of medium complexity, entirely supported by an integrated development environment, could mean a double contribution to the industry of systems development. On the ...

El presente trabajo propone una aplicación de herramientas provenientes del análisis de redes sociales y de programación para la explotación de información de una comunidad online, más específicamente una red soci...

Los modelos gráficos probabilísticos, tales como las redes bayesianas y los diagramas de influencias permiten representar de forma coherente el conocimiento de un dominio bajo condiciones de incertidumbre. Están basad...

In the past, numerous approaches have been formulated either for approximating Pareto-optimal alternatives or supporting the decision making process with an interactive multi criteria decision aiding methodology. The art...

Subjects / keywords: Graph theory; Electronic books

Subjects / keywords: Graph theory; Trees (Graph theory)

Subjects / keywords: Linear programming; Problems, exercises, etc; Graph theory

Subjects / keywords: Social networks; Complexity (Philosophy); Graph theory

Subjects / keywords: Graph databases; Database design; Graph theory; Electronic books

This paper presents a novel method for the analysis and representation of parallel program with MPI. Parallel programs are mapped onto graph-theoretical problems and are represented by DP*Tgraph, extension of T-graphs, t...