Results 21 to 30 of about 27,298 (312)
VNF Chain Placement for Large Scale IoT of Intelligent Transportation
Sensors, 2020 With the advent of the Internet of things (IoT), intelligent transportation has evolved over time to improve traffic safety and efficiency as well as to reduce congestion and environmental pollution.
Xing Wu +4 more
doaj +1 more source
Isomorphic Subgraph Search Algorithm Based on Neighborhood Equivalence Class [PDF]
Jisuanji gongcheng, 2017 Node heterogeneous graph is often used as a data model for complex networks.Isomorphic subgraph search is an important problem in heterogeneous graph mining,but existing algorithms have shortcomings in subgraph removal,which reduces the efficiency of ...
ZHANG Yutong,WANG Simeng,CAO Jia
doaj +1 more source
Small bipartite subgraph polytopes [PDF]
, 2010 We compute a complete linear description of the bipartite subgraph polytope, for up to seven nodes, and a conjectured complete description for eight nodes.
Galli, L +6 more
core +1 more source
Link Prediction Based on Orbit Counting and Graph Auto-Encoder
IEEE Access, 2020 Link prediction aims to predict the missing edge or the edge that may be generated in the future. The key to link prediction is to obtain the characteristic information with strong representation for nodes.
Jian Feng, Shaojian Chen
doaj +1 more source
Saturated Subgraphs of the Hypercube [PDF]
Combinatorics, Probability and Computing, 2016 We say a graph is (Qn,Qm)-saturatedif it is a maximalQm-free subgraph of then-dimensional hypercubeQn. A graph is said to be (Qn,Qm)-semi-saturatedif it is a subgraph ofQnand adding any edge forms a new copy ofQm. The minimum number of edges a (Qn,Qm)-saturated graph (respectively (Qn,Qm)-semi-saturated graph) can have is denoted by sat(Qn,Qm ...
Johnson, JR, Pinto, T
openaire +4 more sources
Frequent Subgraph Mining via Sampling with Rigorous Guarantees [PDF]
, 2022 openFrequent subgraph mining is a fundamental task in the analysis of collections of graphs that aims at finding all the subgraphs that appear with more than a user-specified frequency in the dataset.
PELLIZZONI, PAOLO
core
Efficient Streaming Subgraph Isomorphism with Graph NeuralNetworks
, 2021 Queries to detect isomorphic subgraphs are important in graphbased data management. While the problem of subgraph isomorphism search has received considerable attention for the static setting of a single query, or a batch thereof, existing approaches do ...
Weidlich, Matthias +5 more
core +1 more source
Efficient Algorithms for Subgraph Listing
Algorithms, 2014 Subgraph isomorphism is a fundamental problem in graph theory. In this paper we focus on listing subgraphs isomorphic to a given pattern graph. First, we look at the algorithm due to Chiba and Nishizeki for listing complete subgraphs of fixed size, and ...
Niklas Zechner, Andrzej Lingas
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
In Search of the Densest Subgraph [PDF]
Algorithms, 2019 In this survey paper, we review various concepts of graph density, as well as associated theorems and algorithms. Our goal is motivated by the fact that, in many applications, it is a key algorithmic task to extract a densest subgraph from an input graph, according to some appropriate definition of graph density. While this problem has been the subject
András Faragó, Zohre R. Mojaveri
openaire +3 more sources