Results 21 to 30 of about 11,781 (210)
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
Between Subgraph Isomorphism and Maximum Common Subgraph [PDF]
Proceedings of the AAAI Conference on Artificial Intelligence, 2017 When a small pattern graph does not occur inside a larger target graph, we can ask how to find "as much of the pattern as possible" inside the target graph. In general, this is known as the maximum common subgraph problem, which is much more computationally challenging in practice than subgraph isomorphism.
Hoffmann, Ruth +2 more
openaire +1 more source
The Anonymous Subgraph Problem [PDF]
Computers & Operations Research, 2013 In this work we address the Anonymous Subgraph Problem (ASP). The problem asks to decide whether a directed graph contains anonymous subgraphs of a given family. This problem has a number of practical applications and here we describe three of them (Secret Santa Problem, anonymous routing, robust paths) that can be formulated as ASPs.
A. Bettinelli +3 more
openaire +2 more sources
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
Transactions of the American Mathematical Society, 1957 of the general theorem about the existence of subgraphs with prescribed local degrees. The criterion obtained is related to a criterion established by Tutte but it is considerably simpler in its application, through the fact that it refers only to the properties of single subsets of the vertex set, while the criterion of Tutte involves the choice of ...
openaire +2 more sources
Induced Subgraphs of Induced Subgraphs of Large Chromatic Number
Combinatorica, 2023 AbstractWe prove that, for every graph F with at least one edge, there is a constant $$c_F$$ c F such that there are graphs of arbitrarily large chromatic number and the same clique number as F in which every F-free induced subgraph has chromatic number at ...
Girao, A +6 more
openaire +4 more sources
Directed Subgraph Complexes [PDF]
The Electronic Journal of Combinatorics, 2004 Let $G$ be a directed graph, and let $\Delta^{ACY}_G$ be the simplicial complex whose simplices are the edge sets of acyclic subgraphs of $G$. Similarly, we define $\Delta^{NSC}_G$ to be the simplicial complex with the edge sets of not strongly connected subgraphs of $G$ as simplices. We show that $\Delta^{ACY}_G$ is homotopy equivalent to the $(n-1-k)$
openaire +2 more sources
Spanning Rigid Subgraph Packing and Sparse Subgraph Covering [PDF]
SIAM Journal on Discrete Mathematics, 2018 12 ...
openaire +2 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
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