Results 11 to 20 of about 11,781 (210)
AbstractA chordal graph is a graph with no induced cycles of length at least $4$ . Let $f(n,m)$ be the maximal integer such that every graph with $n$ vertices and $m$ edges has a chordal subgraph with at least $f(n,m)$ edges. In 1985 Erdős and Laskar posed the problem of estimating $f(n,m)$ .
Gishboliner, Lior, Sudakov, Benny
openaire +2 more sources
In-Memory Caching for Enhancing Subgraph Accessibility
Graphs have been utilized in various fields because of the development of social media and mobile devices. Various studies have also been conducted on caching techniques to reduce input and output costs when processing a large amount of graph data.
Kyoungsoo Bok +4 more
doaj +1 more source
The t-Graphs over Finitely Generated Groups and the Minkowski Metric
In this paper, we introduce t-graphs defined on finitely generated groups. We study some general aspects of the t-graphs on two-generator groups, emphasizing establishing necessary conditions for their connectedness.
Gabriela Diaz-Porto +2 more
doaj +1 more source
Knowledge Graph Link Prediction Based on Subgraph Reasoning [PDF]
Relationship prediction in knowledge graph aims to identify and infer new relationships from existing data, and provides knowledge services for many downstream tasks.
YU Huilin, CHEN Wei, WANG Qi, GAO Jianwei, WAN Huaiyu
doaj +1 more source
VNF Chain Placement for Large Scale IoT of Intelligent Transportation
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]
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
Stochastic Subgraph Neighborhood Pooling for Subgraph Classification
Subgraph classification is an emerging field in graph representation learning where the task is to classify a group of nodes (i.e., a subgraph) within a graph. Subgraph classification has applications such as predicting the cellular function of a group of proteins or identifying rare diseases given a collection of phenotypes.
Shweta Ann Jacob +2 more
openaire +2 more sources
Link Prediction Based on Orbit Counting and Graph Auto-Encoder
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
Subgraph nomination: query by example subgraph retrieval in networks
37 pages, 11 ...
Al-Fahad Al-Qadhi +3 more
openaire +2 more sources
Efficient Algorithms for Subgraph Listing
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

