Results 111 to 120 of about 27,298 (312)
Lower Bounds for Maximum Weight Bisections of Weighted Triangle‐Free Subcubic Graphs
Journal of Graph Theory, EarlyView.ABSTRACT A bisection of a graph is a cut in which the number of vertices in the two parts of the cut differ by at most 1. In this paper, we consider maximum weight bisections of edge‐weighted triangle‐free subcubic graphs and show that every weighted triangle‐free subcubic graph G = ( V , E , w ) $G=(V,E,w)$ has a bisection with weight at least θ ⋅ w (
Stefanie Gerke +3 more
wiley +1 more source
Probabilistic Approach to Structural Change Prediction in Evolving Social Networks
, 2012 We propose a predictive model of structural changes in elementary subgraphs of social network based on Mixture of Markov Chains. The model is trained and verified on a dataset from a large corporate social network analyzed in short, one day-long time
Musial, Katarzyna +4 more
core
Illustration of pruning the dependency subgraph and linear subgraph.
, 2012 Illustration of pruning the dependency subgraph and linear subgraph.
Yijia Zhang (125027) +4 more
core +1 more source
Strong subgraph k‐connectivity [PDF]
, 2018 Generalized connectivity introduced by Hager [J. Combin. Theory Ser. B 38 (1985), pp. 179–189] has been studied extensively in undirected graphs and become an established area in undirected graph theory.
Gutin, Gregory +8 more
core +1 more source
A Coarse Geometric Approach to Graph Layout Problems
Journal of Graph Theory, EarlyView.ABSTRACT We define a range of new coarse geometric invariants based on various graph–theoretic measures of complexity for finite graphs, including treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these invariants can be used to define functions which satisfy a strong monotonicity property, namely, they are ...
Wanying Huang +3 more
wiley +1 more source
Tongxin xuebao, 2020 Based on improved ant colony algorithm and subgraph evolution fusion, a new unsupervised social network link prediction method (SE-ACO) was proposed.First, the special subgraph was determined in the social network graph.Then the evolution of the subgraph
Qiuyang GU, Chunhua JU, Gongxing WU
doaj +2 more sources
Algorithms for Densest Subgraphs of Vertex-Weighted Graphs
MathematicsFinding the densest subgraph has tremendous potential in computer vision and social network research, among other domains. In computer vision, it can demonstrate essential structures, and in social network research, it aids in identifying closely ...
Zhongling Liu +4 more
doaj +1 more source
Subgraph and object context‐masked network for scene graph generation
IET Computer Vision, 2020 Scene graph generation is to recognise objects and their semantic relationships in an image and can help computers understand visual scene. To improve relationship prediction, geometry information is essential and usually incorporated into relationship ...
Zhenxing Zheng +3 more
doaj +1 more source
Ontology-based subgraph querying
, 2013 — Subgraph querying has been applied in a variety of emerging applications. Traditional subgraph querying based on subgraph isomorphism requires identical label matching, which is often too restrictive to capture the matches that are semantically close ...
Xifeng Yan, Shengqi Yang, Yinghui Wu
core +1 more source