On decomposition of graphs - E&s, Hajnal - 1967L. Lovasz, On decomposition of graphs, Acta Mathematica Hungarica, 18(3- 4):359-377, 1967.P. Erdős and A. Hajnal, On decomposition of graphs, Acta Math. Acad. Sci. Hungar. , 18 (1967), 359–377....
A decomposition of a simple graph $G$ is a pair $(G,P)$ where $P$ is a set of subgraphs of $G$, which partitions the edges of $G$ in the sense that every edge of $G$ belongs to exactly one subgraph in $P$. If the elements of $P$ are indu... G Araujo-Pardo,C Rubi...
Stanford - It covers hashing, dimension reduction, linear and convex programming, gradient descent and regression, sampling and estimation, compressive sensing, linear-algebraic techniques (principal components analysis, singular value decomposition, spectral techniques), and an intro to differential privacy....
Generating Logical Forms from Graph Representations of Text and Entities. ACL 2019. paper Peter Shaw, Philip Massey, Angelica Chen, Francesco Piccinno, Yasemin Altun. Matching Article Pairs with Graphical Decomposition and Convolutions. ACL 2019. paper Bang Liu, Di Niu, Haojie Wei, Jinghong Lin,...
Generating Logical Forms from Graph Representations of Text and Entities. ACL 2019. paper Peter Shaw, Philip Massey, Angelica Chen, Francesco Piccinno, Yasemin Altun. Matching Article Pairs with Graphical Decomposition and Convolutions. ACL 2019. paper Bang Liu, Di Niu, Haojie Wei, Jinghong Lin,...
In Turán type extremal problems we usually have some sample graphs L1,…,Lr, and consider a graph G n on n vertices not containing any L i . We ask for the maximum number of edges such a G n can have. We may ask similar questions for hypergraphs, multigraphs and digraphs. We may ...
A graph is called #phi#-convered if each edge may lie onan even ear of an optimal ear-decomposition. Several theorems on matching-covered graphs will be generalized for #phi#-covered graphs.Z.SzigetiInteger programming and combinatorial optimization: 7th international conference on integer ...
Generating Logical Forms from Graph Representations of Text and Entities. ACL 2019. paper Peter Shaw, Philip Massey, Angelica Chen, Francesco Piccinno, Yasemin Altun. Matching Article Pairs with Graphical Decomposition and Convolutions. ACL 2019. paper Bang Liu, Di Niu, Haojie Wei, Jinghong Lin,...
Generating Logical Forms from Graph Representations of Text and Entities. ACL 2019. paper Peter Shaw, Philip Massey, Angelica Chen, Francesco Piccinno, Yasemin Altun. Matching Article Pairs with Graphical Decomposition and Convolutions. ACL 2019. paper Bang Liu, Di Niu, Haojie Wei, Jinghong Lin,...
Any non-zero ideal in a number field can be factored into a product of prime ideals. In this paper we report a surprising connection between the complexity of the shortest vector problem (SVP) of prime ideals in number fields and their decomposition groups. When applying the result to number...