On Some Bounds on the Group Betweenness Centrality and Their Algorithmic Use

Date

2014-02-05

Author

Tural, Mustafa Kemal

Metadata

Show full item record

Item Usage Stats

36
views

0
downloads

URI

https://hdl.handle.net/11511/75404

Collections

Unverified, Conference / Seminar

Suggestions

OpenMETU
Core

On the relative energy associated with space-times of diagonal metrics Korunur, Murat; Salt, Mustafa; Havare, Ali (Springer Science and Business Media LLC, 2007-05-01) In order to evaluate the energy distribution (due to matter and fields including gravitation) associated with a space-time model of generalized diagonal metric, we consider the Einstein, Bergmann-Thomson and Landau-Lifshitz energy and/or momentum definitions both in Einstein's theory of general relativity and the teleparallel gravity (the tetrad theory of gravitation). We find same energy distribution using Einstein and Bergmann-Thomson formulations, but we also find that the energy-momentum prescription of...
On the extrapolated VMS-POD method for incompressible flows Güler Eroğlu, Fatma; Kaya Merdan, Songül (2019-12-01) In this study, proper orthogonal decomposition based reduced-order modelling and variational multiscale stabilization method are utilized for the incompressible Navier-Stokes equations. In addition, the difficulties resulting from nonlinearity are eliminated using the extrapolation. Theoretical analysis of the method is presented. To check the efficiency of the proposed method, we utilize the test problem of 2D channel flow past a cylinder.
ON THE FITTING LENGTH OF GENERALIZED HUGHES SUBGROUP Ercan, Gülin (Springer Science and Business Media LLC, 1990-01-01)
On Valid Inequalities for the Maximal Matching Polytope Tural, Mustafa Kemal (2013-07-01)
On the arithmetic complexity of Strassen-like matrix multiplications Cenk, Murat (2017-05-01) The Strassen algorithm for multiplying 2 x 2 matrices requires seven multiplications and 18 additions. The recursive use of this algorithm for matrices of dimension n yields a total arithmetic complexity of (7n(2.81) - 6n(2)) for n = 2(k). Winograd showed that using seven multiplications for this kind of matrix multiplication is optimal. Therefore, any algorithm for multiplying 2 x 2 matrices with seven multiplications is called a Strassen-like algorithm. Winograd also discovered an additively optimal Stras...

Citation Formats

M. K. Tural, “On Some Bounds on the Group Betweenness Centrality and Their Algorithmic Use,” 2014, Accessed: 00, 2021. [Online]. Available: https://hdl.handle.net/11511/75404.