Results 21 to 30 of about 22,888 (290)
Approximation algorithms for multi-multiway cut and multicut problems on directed graphs [PDF]
AUT Journal of Mathematics and Computing, 2020 In this paper, we study the directed multicut and directed multimultiway cut problems. The input to the directed multi-multiway cut problem is a weighted directed graph $G=(V,E)$ and $k$ sets $S_1, S_2,\cdots, S_k$ of vertices.
Ramin Yarinezhad, Seyed Naser Hashemi
doaj +1 more source
Finding a heaviest vertex-weighted triangle is not harder than matrix multiplication [PDF]
, 2009 We show that a maximum-weight triangle in an undirected graph with n vertices and real weights assigned to vertices can be found in time O(n(omega) + n(2+o(1))), where omega is the exponent of the fastest matrix multiplication algorithm. By the currently
Lingas, Andrzej, +4 more
core +1 more source
Semi-Markov graph dynamics. [PDF]
PLoS ONE, 2011 In this paper, we outline a model of graph (or network) dynamics based on two ingredients. The first ingredient is a Markov chain on the space of possible graphs. The second ingredient is a semi-Markov counting process of renewal type. The model consists
Marco Raberto +2 more
doaj +1 more source
Parallel modularity computation for directed weighted graphs with overlapping communities
Труды Института системного программирования РАН, 2018 The paper presents new versions of modularity measure for directed weighted graphs with overlapping communities. We consider several approaches to computing modularity and try to extend them.
Mikhail Drobyshevskiy +2 more
doaj +1 more source
Community mining on dynamic weighted directed graphs [PDF]
Proceedings of the 1st ACM international workshop on Complex networks meet information & knowledge management, 2009 This paper focuses on community mining including community discovery and change-point detection on dynamic weighted directed graphs(DWDG). Real networks such as e-mail, co-author and financial networks can be modeled as DWDG. Community mining on DWDG has not been studied thoroughly, although that on static(or dynamic undirected unweighted)graphs has ...
Dongsheng Duan +3 more
openaire +1 more source
Graph theory applications in congenital heart disease
Scientific Reports, 2023 Graph theory can be used to address problems with complex network structures. Congenital heart diseases (CHDs) involve complex abnormal connections between chambers, vessels, and organs.
Yao-Ting Lee, Shyh-Jye Chen
doaj +1 more source
Maximum weight cycle packing in directed graphs, with application to kidney exchange programs [PDF]
, 2009 Centralized matching programs have been established in several countries to organize kidney exchanges between incompatible patient-donor pairs. At the heart of these programs are algorithms to solve kidney exchange problems, which can be modelled as ...
Biro, P., Rizzi, R., Manlove, D.F.
core +1 more source
Directional graph weight prediction for image compression [PDF]
2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2017 Graph-based models have recently attracted attention for their potential to enhance transform coding image compression thanks to their capability to efficiently represent discontinuities. Graph transform gets closer to the optimal KLT by using weights that represent inter-pixel correlations but the extra cost to provide such weights can overwhelm the ...
Francesco Verdoja, Marco Grangetto
openaire +1 more source
Method Maximizing the Spread of Influence in Directed Signed Weighted Graphs
Advances in Electrical and Electronic Engineering, 2017 We propose a new method for maximizing the spread of influence, based on the identification of significant factors of the total energy of a control system.
Alexander Nikolaevich Tselykh +3 more
doaj +1 more source
Iterative improvement approaches for collecting weighted items in directed bipartite graphs
Journal of Advanced Mechanical Design, Systems, and Manufacturing, 2018 In this paper, an iterative improvement heuristic based on the simulated annealing is designed for a weighted item collecting problem in directed bipartite graphs.
Yoshiyuki KARUNO, Seiya TANAKA
doaj +1 more source