A nearly optimal distributed algorithm for computing the weighted girth

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Distributed Iterative Algorithm for Optimal Scheduling in Grid Computing

The paper studies a distributed iterative algorithm for optimal scheduling in grid computing. Grid user’s requirements are formulated as dimensions in a quality of service problem expressed as a market game played by grid resource agents and grid task agents. User benefits resulting from taking decisions regarding each Quality of Service dimension are described by separate utility functions. Th...

متن کامل

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

15 صفحه اول

An Optimal Distributed Algorithm for Computing Bridge-Connected

Consider a connected undirected graph G =< N , E >, where N is the set of n nodes, and E is the set of e edges. Without loss of generality, I assume N to be {1, 2, . . . , n}. An edge (i, j) ∈ E is a bridge of G if the removal of (i, j) disconnects G. Clearly, the removal of a bridge increases the number of connected components of a graph by one. The bridge-connected components problem consists...

متن کامل

A nearly-optimal Fano-based coding algorithm

Statistical coding techniques have been used for a long time in lossless data compression, using methods such as Hu man's algorithm, arithmetic coding, Shannon's method, Fano's method, etc. Most of these methods can be implemented either statically or adaptively. In this paper, we show that although Fano coding is suboptimal, it is possible to generate static Fano-based encoding schemes which a...

متن کامل

A SIMPLE ALGORITHM FOR COMPUTING TOPOLOGICAL INDICES OF DENDRIMERS

Dendritic macromolecules’ have attracted much attention as organic examples of well-defined nanostructures. These molecules are ideal model systems for studying how physical properties depend on molecular size and architecture. In this paper using a simple result, some GAP programs are prepared to compute Wiener and hyper Wiener indices of dendrimers.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Science China Information Sciences

سال: 2021

ISSN: 1674-733X,1869-1919

DOI: 10.1007/s11432-020-2931-x