Results 81 to 90 of about 11,781 (210)
Finding Maximum Weight 2‐Packing Sets on Arbitrary Graphs
Networks, EarlyView.ABSTRACT A 2‐packing set for an undirected, weighted graph G=(V,E,w)$$ G=\left(V,\kern0.3em E,\kern0.3em w\right) $$ is a subset 𝒮⊆V such that any two vertices v1,v2∈𝒮 are not adjacent and have no common neighbors. The Maximum Weight 2‐Packing Set problem that asks for a 2‐packing set of maximum weight is NP$$ \mathbf{NP} $$‐hard. Next to 13 novel data
Jannick Borowitz +2 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
The Parameterized Complexity of the Rainbow Subgraph Problem
Algorithms, 2015 The NP-hard RAINBOW SUBGRAPH problem, motivated from bioinformatics, is to find in an edge-colored graph a subgraph that contains each edge color exactly once and has at most \(k\) vertices.
Falk Hüffner +3 more
doaj +1 more source
Location‐Assisted Graph‐Based User Scheduling in Multi‐User MIMO LEO NTN Systems
International Journal of Satellite Communications and Networking, EarlyView.ABSTRACT This paper addresses user clustering and scheduling for multi‐user MIMO low Earth orbit nonterrestrial network systems in full frequency reuse. Since the number of on‐ground user terminals is usually much higher than the number of on‐board LEO satellite antennas, user scheduling becomes a fundamental task.
Bilal Ahmad +4 more
wiley +1 more source
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
Analysis of size of the largest dense subgraph of random hypergraph
Труды Института системного программирования РАН, 2018 Random networks are often described using Erdos-Renyi model of random graph . The concept of graph density is often used in random network analysis.
N. N. Kuzyrin, D. O. Lazarev
doaj +1 more source
Strategic Management Journal, EarlyView.Abstract Research Summary We extend ecosystem theory to cases in which platforms are complementors to each other: inter‐platform ecosystems. Analyzing web traffic data on 241 European platforms, we identify and characterize demand‐side inter‐platform ecosystems, and propose a theory of why they emerge.
Bruno Carballa‐Smichowski +3 more
wiley +1 more source
Solar RRL, EarlyView.This study investigates the effect of the chemical composition on the properties of A(BB’)(XX’)3$_3$ inorganic halide perovskites with density functional theory. By correlating distortion amplitudes with both composition and the Goldschmidt tolerance factor, we propose a pragmatic approach to designing more stable and efficient perovskites, advancing ...
Antoine Gissler +2 more
wiley +1 more source
A Resource Efficient Ising Model‐Based Quantum Sudoku Solver
Software: Practice and Experience, EarlyView.ABSTRACT Background Quantum algorithms exploit superposition and parallelism to address complex combinatorial problems, many of which fall into the non‐polynomial (NP) class. Sudoku, a widely known logic‐based puzzle, is proven to be NP‐complete and thus presents a suitable testbed for exploring quantum optimization approaches.
Wen‐Li Wang +5 more
wiley +1 more source
Journal of Combinatorial Theory, Series B, 1972 AbstractSuppose G is a graph without loops or digons and H is a spanning subgraph of G. Let A(G) be the automorphism group of G. The subgraph H belongs to the set J(G) of fixing subgraphs ofG if and only if G contains exactly |A(G)||A(H)| subgraphs isomorphic to H. Clearly G ϵ J(G).
openaire +1 more source