Results 1  10
of
251,298
GRAPHTHEORETICAL CONCEPTS AND PHYSIOCHEMICAL DATA
"... Graph theoretical concepts have been used to model the molecular polarizabilities of fiftyfour organic derivatives, and the induced dipole moment of a set of fiftyseven organic compounds divided into three subsets. The starting point of these modeling strategies is the hydrogensuppressed chemical ..."
Abstract
 Add to MetaCart
Graph theoretical concepts have been used to model the molecular polarizabilities of fiftyfour organic derivatives, and the induced dipole moment of a set of fiftyseven organic compounds divided into three subsets. The starting point of these modeling strategies is the hydrogen
Online Algorithms: A Study of GraphTheoretic Concepts
"... . In this paper we survey results on the design and analysis of online algorithms, focusing on problems where graphs and graphtheoretic concepts have proven particularly useful in the formulation or in the solution of the problem. For each of the problems addressed, we also present important ope ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
. In this paper we survey results on the design and analysis of online algorithms, focusing on problems where graphs and graphtheoretic concepts have proven particularly useful in the formulation or in the solution of the problem. For each of the problems addressed, we also present important
A Graph Theoretical Concept for LSP Hierarchies
, 2001
"... In this paper we propose the use of Multiprotocol Label Switching (MPLS) to achieve scalability of resource management that is needed to provide quality of service guarantees in IP networks. We suggest a hierarchical structure of Label Switched Paths (LSPs) to reduce the stored reservation inform ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In this paper we propose the use of Multiprotocol Label Switching (MPLS) to achieve scalability of resource management that is needed to provide quality of service guarantees in IP networks. We suggest a hierarchical structure of Label Switched Paths (LSPs) to reduce the stored reservation information to a minimum.
Consensus and cooperation in networked multiagent systems
 Proceedings of the IEEE
, 2007
"... Summary. This paper provides a theoretical framework for analysis of consensus algorithms for multiagent networked systems with an emphasis on the role of directed information flow, robustness to changes in network topology due to link/node failures, timedelays, and performance guarantees. An ove ..."
Abstract

Cited by 801 (3 self)
 Add to MetaCart
. An overview of basic concepts of information consensus in networks and methods of convergence and performance analysis for the algorithms are provided. Our analysis framework is based on tools from matrix theory, algebraic graph theory, and control theory. We discuss the connections between consensus problems
Graphtheoretic fibring of logics
 Part II  Completeness preservation. Preprint, SQIG  IT and IST  TU Lisbon
, 2008
"... A graphtheoretic account of fibring of logics is developed, capitalizing on the interleaving characteristics of fibring at the linguistic, semantic and proof levels. Fibring of two signatures is seen as an mgraph where the nodes and the medges include the sorts and the constructors of the signatu ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
A graphtheoretic account of fibring of logics is developed, capitalizing on the interleaving characteristics of fibring at the linguistic, semantic and proof levels. Fibring of two signatures is seen as an mgraph where the nodes and the medges include the sorts and the constructors
Some Applications of Graph Theory
, 2000
"... We review three graphtheoretical concepts: graph coloring, intersection graph, and competition graph. For each, we mention a variety of applications, discuss generalizations of the concept arising from the applications, and describe some recent results and open questions. ..."
Abstract
 Add to MetaCart
We review three graphtheoretical concepts: graph coloring, intersection graph, and competition graph. For each, we mention a variety of applications, discuss generalizations of the concept arising from the applications, and describe some recent results and open questions.
Horting Hatches an Egg: A New GraphTheoretic Approach to Collaborative Filtering
 In Proceedings of the Fifth ACM SIGKDD International Conference on Knowledge discovery and data mining
, 1999
"... This paper introduces a new and novel approach to ratingbased collaborative filtering. The new technique is most appropriate for ecommerce merchants offering one or more groups of relatively homogeneous items such as compact disks, videos, books, software and the like. In contrast with other known ..."
Abstract

Cited by 133 (1 self)
 Add to MetaCart
collaborative filtering techniques, the new algorithm is graphtheoretic, based on the twin new concepts of horting and predictability. As is demonstrated in this paper, the technique is fast, scalable, accurate, and requires only a modest learning curve. It makes use of a hierarchical classification scheme
A graphtheoretic account of logics
, 2009
"... A graphtheoretic account of logics is explored based on the general notion of mgraph (that is, a graph where each edge can have a finite sequence of nodes as source). Signatures, interpretation structures and deduction systems are seen as mgraphs. After defining a category freely generated by a m ..."
Abstract

Cited by 10 (9 self)
 Add to MetaCart
A graphtheoretic account of logics is explored based on the general notion of mgraph (that is, a graph where each edge can have a finite sequence of nodes as source). Signatures, interpretation structures and deduction systems are seen as mgraphs. After defining a category freely generated by a
Results 1  10
of
251,298