Results 261 to 270 of about 1,372,330 (300)

Random graphs

ACM-SIAM Symposium on Discrete Algorithms, 2006
We will review some of the major results in random graphs and some of the more challenging open problems. We will cover algorithmic and structural questions. We will touch on newer models, including those related to the WWW.
Alan M. Frieze
semanticscholar   +1 more source

A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs

SIAM Journal on Scientific Computing, 1998
Recently, a number of researchers have investigated a class of graph partitioning algorithms that reduce the size of the graph by collapsing vertices and edges, partition the smaller graph, and then uncoarsen it to construct a partition for the original ...
G. Karypis, Vipin Kumar
semanticscholar   +1 more source

Factor graphs and the sum-product algorithm

IEEE Transactions on Information Theory, 2001
Algorithms that must deal with complicated global functions of many variables often exploit the manner in which the given functions factor as a product of "local" functions, each of which depends on a subset of the variables.
F. Kschischang, B. Frey, Hans-Andrea Loeliger   +2 more
semanticscholar   +1 more source

The blict graph and blitact graph of a graph

Journal of Discrete Mathematical Sciences and Cryptography, 2001
Abstract In this paper, we introduce the concepts of the blict graph and blitact graph of a graph. We obtain some properties of these graphs. We present characterizations of graphs whose blict graphs and blitact graphs are planar, outerplanar, maximal outerplanar and minimally nonouterplanar.
M. S. Biradar, V. R. Kulli
openaire   +2 more sources

An efficient heuristic procedure for partitioning graphs

Bell Labs technical journal, 1970
We consider the problem of partitioning the nodes of a graph with costs on its edges into subsets of given sizes so as to minimize the sum of the costs on all edges cut.
B. Kernighan, Shou-De Lin
semanticscholar   +1 more source

Fundamentals of domination in graphs

The Pure and Applied Mathematics, 1998
Bounds on the domination number domination, independence and irredundance efficiency, redundancy and the duals changing and unchanging domination conditions on the dominating set varieties of domination multiproperty and multiset parameters sums and ...
T. Haynes, S. Hedetniemi, P. Slater
semanticscholar   +1 more source

DySAT: Deep Neural Representation Learning on Dynamic Graphs via Self-Attention Networks

Web Search and Data Mining, 2020
Learning node representations in graphs is important for many applications such as link prediction, node classification, and community detection. Existing graph representation learning methods primarily target static graphs while many real-world graphs ...
Aravind Sankar, Yanhong Wu, Liang Gou, Wei Zhang, Hao Yang   +4 more
semanticscholar   +1 more source

Spectra of Graphs

, 2011
This book gives an elementary treatment of the basic material about graph spectra, both for ordinary, and Laplace and Seidel spectra. The text progresses systematically, by covering standard topics before presenting some new material on trees, strongly ...
A. Brouwer, W. Haemers
semanticscholar   +1 more source

Graph equations for line graphs, blitact graphs and blict graphs

Journal of Discrete Mathematical Sciences and Cryptography, 2005
Abstract In this paper, we solve the graph equations L(G)=B m (H), L(G) and . The equality symbol ‘=’ stands for an isomorphism between two graphs.
Veena Mathad, B. Basavanagoud
openaire   +2 more sources

Conceptual Graphs Are Also Graphs

2014
The main objective of this paper is to add one more brick in building the CG model as a knowledge representation model autonomous from logic. The CG model is not only a graphical representation of logic, it is much more: it is a declarative model encoding knowledge in a mathematical theory, namely labelled graph theory, which has efficient computable ...
Chein, Michel, Mugnier, Marie-Laure
openaire   +3 more sources