The chromatic number of a graph G, denoted by χ(G), is the minimum number of colors such that G can be colored with these colors in such a way that no two adjacent vertices have the same color. A clique in a graph is a set of mutually adjacent vertices. The maximum size of a clique in a graph G is called the clique number of G. The Turán graph Tn(k) is a complete k-partite graph whose partition...

A graphical formalized language is proposed for specifying systems of views over database schemas. The language is based on the notion of arrow (mapping) between data schemas and is suitable for any data model for which schema mappings are defined. In particular, the constructs of query, query language, view and view integration can be consistently expressed in this arrow formalism and correspo...

This paper deals with the evaluation of multiagent systems. The related works in this issue are most often interested in evaluation of agent design methodologies or agent tools and platforms but do not address sufficiently evaluation of multiagent applications from a general point of view, the used evaluation criteria remain either specific to a special topic or application dependent. In this w...

Modern Web data is highly structured in terms of entities and relations from large knowledge resources, geo-temporal references and social network structure, resulting in a massive multidimensional graph. This graph essentially unifies both the searcher and the information resources that played a fundamentally different role in traditional IR, and “Graph Search” offers major new ways to access ...

We present a critical review and analysis of different categories of routing protocols for cognitive radio networks. We first classify the available solutions to two broad categories: those based on full spectrum knowledge (typically used to establish performance benchmarks) and those based on local spectrum knowledge (used for real-time implementation). The full spectrum knowledge based routin...

the dispersibility of graphene is modeled as a mathematical function of the molecular structure of solvent represented by simplified molecular input-line entry systems (smiles) together with the graph of atomic orbitals (gao). the gao is molecular graph where atomic orbitals e.g. 1s1, 2p4, 3d7 etc., are vertexes of the graph instead of the chemical elements used as the graph vertexes in the tra...

Modern Web data is highly structured in terms of entities and relations from large knowledge resources, geo-temporal references and social network structure, resulting in a massive multidimensional graph. This graph essentially unifies both the searcher and the information resources that played a fundamentally different role in traditional IR, and “Graph Search” offers major new ways to access ...

Previous work on graph visualization has yielded a wealth of efficient graph analysis algorithms and expressive visual mappings. To support the visual exploration of graph structures, a high degree of interactivity is required as well. We present a fully implemented graph visualization system, called CGV (Coordinated Graph Visualization), whose particular emphasis is on interaction. The system ...

Introduction: Graph theoretical analysis of functional Magnetic Resonance Imaging (fMRI) data has provided new measures of mapping human brain in vivo. Of all methods to measure the functional connectivity between regions, Linear Correlation (LC) calculation of activity time series of the brain regions as a linear measure is considered the most ubiquitous one. The strength of the dependence obl...