Results 231 to 240 of about 517,969 (263)

Odd factors of a graph

Graphs and Combinatorics, 1993
\textit{C. Yuting} and \textit{M. Kano} [J. Graph Theory 12, No. 3, 327-333 (1988; Zbl 0661.05049)] gave a necessary and sufficient condition for \(G\) to have a \([1,f]\)-odd factor (where given \(f:v(G) \to \{1,3,5, \dots\}\), a \([1,f]\)-odd factor is a subgraph \(H\) of \(G\) so that \(\deg_ H (x) \in \{1,2, \dots, f(x)\}\) for all \(x \in V(G))\).
Jerzy Topp, Preben D. Vestergaard
openaire   +2 more sources

On factor graphs and the Fourier transform

Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252), 2002
We introduce the concept of convolutional factor graphs, which represent convolutional factorizations of multivariate functions, just as conventional (multiplicative) factor graphs represent multiplicative factorizations. Convolutional and multiplicative factor graphs arise as natural Fourier transform duals.
Yongyi Mao, Frank R. Kschischang
openaire   +1 more source

Amalgamated Factorizations of Complete Graphs

Combinatorics, Probability and Computing, 1994
We give some sufficient conditions for an (S, U)-outline T-factorization of Kn to be an (S, U)-amalgamated T-factorization of Kn. We then apply these to give various necessary and sufficient conditions for edge coloured graphs G to have recoverable embeddings in T-factorized Kn's.
J. Keith Dugdale, Anthony J. W. Hilton
openaire   +2 more sources

[a,b]‐factorizations of graphs

Journal of Graph Theory, 1991
AbstractLet a and b be integers with b ⩾ a ⩾ 0. A graph G is called an [a,b]‐graph if a ⩽ dG(v) ⩽ b for each vertex v ∈ V(G), and an [a,b]‐factor of a graph G is a spanning [a,b]‐subgraph of G. A graph is [a,b]‐factorable if its edges can be decomposed into [a,b]‐factors. The purpose of this paper is to prove the following three theorems: (i) if 1 ⩽ b ⩽
openaire   +2 more sources

Notes on Factor Graphs

2009
Many applications that involve inference and learning in signal processing, communication and artificial intelligence can be cast into a graph framework. Factor graphs are a type of network that can be studied and solved by propagating belief messages with the sum/product algorithm.
openaire   +2 more sources

A 1‐factorization of the line graphs of complete graphs

Journal of Graph Theory, 1982
AbstractA 1‐factorization is constructed for the line graph of the complete graph Kn when n is congruent to 0 or 1 modulo 4.
openaire   +1 more source

Factor graphs and graph ensembles

2009
AbstractProbabilistic systems involving a large number of simple variables with mutual dependencies appear recurrently in several fields of science. It is often the case that such dependencies can be factorized in a non-trivial way, and distinct variables interact only ‘locally’. This important structural property plays a crucial role.
Marc Mézard, Andrea Montanari
openaire   +1 more source

Orthogonal one‐factorization graphs

Journal of Graph Theory, 1985
AbstractAn orthogonal one‐factorization graph (OOFG) is a graph in which the vertices are one‐factorizations of some underlying graph H, and two vertices are adjacent if and only if the one‐factorizations are orthogonal. An arbitrary finite graph, G, is realizable if there is an OOFG isomorphic to G.
openaire   +1 more source

A Comprehensive Survey on Graph Neural Networks

IEEE Transactions on Neural Networks and Learning Systems, 2021
Zonghan Wu, Shirui Pan, Guodong Long
exaly  

Graph neural networks: A review of methods and applications

AI Open, 2020
Zhengyan Zhang, Zhiyuan Liu, Changcheng Li   +2 more
exaly