Results 31 to 40 of about 27,298 (312)
Finding a heaviest vertex-weighted triangle is not harder than matrix multiplication [PDF]
, 2009 We show that a maximum-weight triangle in an undirected graph with n vertices and real weights assigned to vertices can be found in time O(n(omega) + n(2+o(1))), where omega is the exponent of the fastest matrix multiplication algorithm. By the currently
Lingas, Andrzej, +4 more
core +1 more source
Non-adaptive Group Testing on Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 Grebinski and Kucherov (1998) and Alon et al. (2004-2005) study the problem of learning a hidden graph for some especial cases, such as hamiltonian cycle, cliques, stars, and matchings.
Hamid Kameli
doaj +1 more source
Learning a Hidden Subgraph [PDF]
SIAM Journal on Discrete Mathematics, 2004 Summary: We consider the problem of learning a labeled graph from a given family of graphs on \(n\) vertices in a model where the only allowed operation is to query whether a set of vertices induces an edge. Questions of this type are motivated by problems in molecular biology.
Noga Alon, Vera Asodi
openaire +2 more sources
Discrete Mathematics, 1993 This note is concerned with a question on the maximum possible \(s\) such that an arbitrary graph or hypergraph \(G\) contains a pair of edge disjoint isomorphic subgraphs of size \(s\). The authors investigate this question in the case of 3-uniform hypergraphs.
Ronald J. Gould, Vojtech Rödl
openaire +1 more source
Dynamic graph dropout for subgraph-based relation prediction
, 2022 Relation prediction for knowledge graphs aims at predicting missing relationships between entities. Inductive relation prediction methods have received increasing attention because of their capability of handling unseen entities.
Mai, S +5 more
core +1 more source
Diversity of Building Blocks Unity of Construction Rule for Transportation Networks [PDF]
E3S Web of Conferences, 2021 The identification of local structure composition may help understand the network construction law from a bottom-up view. Focusing on local structure, the network subgraph approach was applied to systematically analyze 3- to 7-node subgraphs in several ...
Li Bangya, Liu Liang
doaj +1 more source
Maxmaxflow and Counting Subgraphs [PDF]
The Electronic Journal of Combinatorics, 2010 We introduce a new graph invariant $\Lambda(G)$ that we call maxmaxflow, and put it in the context of some other well-known graph invariants, notably maximum degree and its relatives. We prove the equivalence of two "dual" definitions of maxmaxflow: one in terms of flows, the other in terms of cocycle bases. We then show how to bound the total number
Bill Jackson, Alan D. Sokal
openaire +3 more sources
Rough-Set-Based Real-Time Interest Label Extraction over Large-Scale Social Networks
Complexity, 2022 Labels provide a quick and effective solution to obtain people interesting content from large-scale social network information. The current interest label extraction method based on the subgraph stream proves the feasibility of the subgraph stream for ...
Xiaoling Huang +5 more
doaj +1 more source
Journal of Graph Theory, 2017 AbstractLet be a graph of density p on n vertices. Following Erdős, Łuczak, and Spencer, an m‐vertex subgraph H of G is called full if H has minimum degree at least . Let denote the order of a largest full subgraph of G. If is a nonnegative integer, define urn:x-wiley:03649024:media:jgt22221:jgt22221-math-0005Erdős, Łuczak, and Spencer proved that ...
Victor Falgas-Ravry +2 more
openaire +4 more sources
Maximum Hypergraphs without Regular Subgraphs
Discussiones Mathematicae Graph Theory, 2014 We show that an n-vertex hypergraph with no r-regular subgraphs has at most 2n−1+r−2 edges. We conjecture that if n > r, then every n-vertex hypergraph with no r-regular subgraphs having the maximum number of edges contains a full star, that is, 2n−1 ...
Kim Jaehoon, Kostochka Alexandr V.
doaj +1 more source